Cognizant Interview Questions 2021

Cognizant Interview Questions 2021 for Freshers here is my interview experience.

On 9th July 2021, I had received mail from the Cognizant.

 The first round consist of 3 Sections :

  1. Quant’s
  2. Logical
  3. Verbal

After clearing Round 1 with not so good marks, you get eligible for the interview round.

Cognizant GenC Interview

The interview round will have both technical and HR interview. The questions will be asked to judge your technical knowledge, cognitive abilities, and the right attitude.

            The package offered for these candidates will be:

  • 4 LPA(probation period)
  • 4.5 LPA( post-probation period).

The result of the round was declared after 1 week and after the 3 days my interview Schedule at 4 pm, I was bit nervous and faced the interview my interview last for 10-15min I had only one round of interview that is Technical questions was asked to me.

Technical  Interview Questions Cognizant(Genc)

  1. Introduce about yourself?
  2. Explain me about your Project?
  3. What is Stack and Queue?
  4. What is for loop?
  5. Write a code to check No is even or not using for loop?
  6. Do you have any questions?

Technical  Interview Questions Cognizant(Genc) Answers

1.Introduce yourself?

Top 20 HR  Interview Questions and Answers

2. Explain to me about your Project?

I had briefly explained about the project that was developed by me during the internship

3.What is Stack and Queue?

Stack :
Stack is a linear data structure. This follows the particular order in which the operations are performed. The order may be LIFO (Last In First Out) or FILO (First In Last Out).
In Stack data structure insertion and deletion happens on the same end, it has one pointer called as Top pointer which indicates at top of the stack.
If the stack is empty and we want to delete an element then it is called underflow and if the stack is full and we want to insert an element to stack then it is called an overflow
For example, there are many real-life examples of a stack. Consider an example of plates stacked over one another in the canteen. The plate which is at the top is the first one to be removed, i.e. the plate which has been placed at the bottommost position remains in the stack for the longest period of time. So, it can be simply seen to follow LIFO (Last In First Out)/FILO (First In Last Out) order.

Queue :
A queue is a linear data structure. This follows the particular order in which the operations are performed. The order is First In First Out (FIFO)
In Queue data structure insertion happens on the Rear end, Deletion happens on the front end.
It has two pointers called as Front pointer and Rear pointer.
For example, A good example of a queue is any queue of consumers for a resource where the consumer that came first is served first. The difference between stacks and queues is in removing. In a stack we remove the item the most recently added; in a queue, we remove the item the least recently added.

4.What is for loop?

In order to repeat the block of code or statement, we use a loop. for loop is used for executing a block of statements repeatedly until a particular condition is satisfied.

5.Write a code to check No is even or not using for loop?

Python code:

n = 6
flag = False
for i in range(0,n+1):
flag = not(flag)
if flag:
Java Code: 

class Main {
public static void main(String[] args) {
int n=5;
boolean flag=false;
for(int i=0;i<=n;i++)

6. Do you have any questions?

It is specific to you what you want to ask. I had asked about the domain and Work culture of the company.

Leave a Reply