10+ Cognizant Interview Questions and Answers

The first question is about checking if a string formed by concatenating all string fields in a linked list is a palindrome or not.

• Traverse the linked list and concatenate all string fields

• Check if the concatenated string is a palindrome by comparing characters from both ends

• Consider edge cases like empty linked list or single node with an empty string field

Use the seesaw 3 times to find the person with different weight among 12 people on an island.

• Divide the 12 people into 3 groups of 4.

• Compare 2 groups on the seesaw, then narrow down the group with the different person.

• Take the 4 people from the identified group and compare 2 of them on the seesaw to find the person with different weight.

Questions on binary tree traversal, multiplying big numbers represented as strings, and detecting k-th node from the back of a linked list.

• Binary tree traversal can be done in three ways: in-order, pre-order, and post-order.

• To multiply two big numbers represented as strings, you can use the grade-school algorithm or Karatsuba algorithm.

• To detect the k-th node from the back of a linked list, you can use two pointers approach or find the length of the list first.

A process is an instance of a program, while a thread is a unit of execution within a process.

• A process is an independent entity that runs in its own memory space, while threads share the same memory space within a process.

• Processes have their own resources, such as file handles and memory, while threads share these resources.

• Processes are heavyweight and have higher overhead, while threads are lightweight and have lower overhead.

• Processes provide better isolation and securit...read more

C++ memory management involves allocating and deallocating memory for variables, while pointers store memory addresses.

• Pointers are variables that store memory addresses.

• They are used to access and manipulate data stored in memory.

• Example: int* ptr = new int; *ptr = 10; delete ptr;