Cognizant Programmer Analyst Interview Questions, Process, and Tips

Q1. If you're given a name pulsar it should return bike or else it should return car
Add your answer

Q1. Mostly asked about full name, current location and all
Add your answer

Quantitative aptitude questions on work and time , profit and loss, percentage, measurement

Q1. Explains project
Add your answer
Q2. DML statement
Add your answer

Q1. General questions
Add your answer

Q1. What are OOPS concepts?
Ans. 
OOPS concepts refer to Object-Oriented Programming concepts which include inheritance, encapsulation, polymorphism, and abstraction.
• Inheritance: Allows a class to inherit properties and behavior from another class.

• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Polymorphism: Ability to present the same interface for different data types.

• Abstraction: Hiding the complex implementation...read more
Answered by AI
Add your answer
Q2. Explain how recursion works with example?
Ans. 
Recursion is a programming technique where a function calls itself to solve a problem.
• Recursion involves breaking down a problem into smaller subproblems and calling the function recursively to solve them.

• Each recursive call works on a smaller input until a base case is reached to stop the recursion.

• Example: Factorial calculation, Fibonacci sequence, tree traversal.
Answered by AI
Add your answer
Q3. Explain Abstraction in java?
Ans. 
Abstraction in Java is the concept of hiding the implementation details and showing only the necessary features of an object.
• Abstraction allows programmers to focus on what an object does instead of how it does it.

• It helps in reducing complexity and improving the efficiency of the code.

• In Java, abstraction is achieved through abstract classes and interfaces.

• Example: Animal is an abstract class with abstract method 'eat...read more
Answered by AI
Add your answer

Maths, Logics, Code Snippets

Q1. What are OOPS concepts and how will be used in problem solving?
Ans. 
OOPS concepts refer to Object-Oriented Programming principles like inheritance, encapsulation, polymorphism, and abstraction.
• Inheritance allows a class to inherit properties and behavior from another class.

• Encapsulation involves bundling data and methods that operate on the data into a single unit.

• Polymorphism allows objects of different classes to be treated as objects of a common superclass.

• Abstraction focuses on hid...read more
Answered by AI
Add your answer
Q2. Explain about projects done during B.Tech course
Add your answer

It was a aptitude test of basic level

Q1. Pointers in c++
Ans. 
Pointers in C++ are variables that store memory addresses of other variables.
• Pointers are declared using the * symbol.

• Pointers can be used to access and manipulate memory directly.

• Pointers can be used to create dynamic memory allocation.

• Example: int *ptr; // declaring a pointer to an integer variable
Answered by AI
Add your answer
Q2. Reverse an array
Ans. 
Reverse an array of strings
• Create a new array to store the reversed strings

• Iterate through the original array in reverse order and add each element to the new array

• Return the new array with reversed strings
Answered by AI
Add your answer

Q1. Spring mvc framework, spring boot
Add your answer
Q2. Internal implementation of hashmap
Ans. 
HashMap is a data structure that stores key-value pairs and uses hashing to quickly retrieve values based on keys.
• HashMap internally uses an array of linked lists to store key-value pairs.

• When a key-value pair is added, the key is hashed to determine the index in the array where the pair will be stored.

• If multiple keys hash to the same index, a collision occurs and the pairs are stored in a linked list at that index.

• To...read more
Answered by AI
Add your answer

Q1. LRU cache design
Ans. 
LRU cache design involves storing recently used items in a cache with limited capacity.
• Use a doubly linked list to keep track of the order of items based on their usage

• Implement a hashmap for fast lookup of items in the cache

• When a new item is accessed, move it to the front of the linked list and update the hashmap accordingly

• If the cache is full, remove the least recently used item from the end of the linked list
Answered by AI
Add your answer