In this page you will find Cognizant GenC Interview Experience 2025 of selected candidates. Read through them to find out the questions asked in Cognizant GenC Interview.
Page Highlights:
GenC stands for Generation Cognizant. It basically means the fresher hiring that Cognizant does.
GenC refers to those candidates who enter Cognizant with no prior experience.
Cognizant conducts off campus and on campus drives to hire freshers for these roles.
I recently got hired in Cognizant for GenC. So Cognizant came to our campus for hiring.
There were 3 rounds in total.
It was an online exam conducted on Superset.
Now Cognizant has divided the online assessment tests into 3 parts:
Round 1: GenC Communication Assessment
Total time: 60 mins
In this section, we had 3 parts:
Round 2: Aptitude Assessment
Total time: 80 mins
This section again had 2 section:
Round 3: Technical Assessment
Total Time: 120 Minutes
This Round includes:
After clearing 3 Round of Of Online Assessment, selected candidates will get further instruction for appearing for Technical and HR Interview.
Sample Questions:
What is software development life cycle?
Answer- SDLC is the process of designing, building and maintaining a software product followed by the software development team. It is basically a systematic approach towards developing a product as per the requirements.
What are OOPS concepts?
Answer- OOPS concepts include class, object, inheritance, abstraction, polymorphism, abstraction.
8. Coding questions like:
a. Write a program to find whether a number is even or odd.
Apply For Jobs
Get Hiring Updates#include<stdio.h>
int main()
{
int number;
printf("Insert a number \n");
scanf("%d",&number):
//Checking if the number is divisible by 2
if (number%2 == 0)
printf("The number is even\n");
else
printf("The number is odd\n");
return 0;
} b. Write a program for the Fibonacci series.
#include<stdio.h>
int main()
{
//To initialize variables
int n1=0,n2=1,n3,limit,i;
//To take user input
printf("enter a limit of series \n");
scanf( "%d",&limit);
printf("Fibonacci series %d %d ",n1,n2);
//To use this loop for given length
for(i=2;i<limit;i++)
{
//n1 and n2 sum store in new variable n3
n3=n1+n2;
n1=n2;
n2=n3;
//display serious
printf("%d ",n3);
}
return 0;
}
The HR Round was also conducted on Superset and was only of 10 minutes.
It was mostly a Document Verification round and they asked for my marksheets and id cards and also asked some basic HR Questions.
1. Where do you see yourself in 5 years?
2. Self Introduction
3. Tell me about your projects.
4. Why should we hire you?
5.What leadership qualities do you have?
Answer: Gave them an example where I had to lead a team.
6.What were the difficulties you faced while working on the project?
7. Do you have any questions for me?
I got placed in Cognizant for the profile of GenC. I would like to share my entire Cognizant Interview Experience with the readers of PrepInsta.
So from our campus, they had informed us about the drive. I applied for the drive and got selected for the online exam.
This round was of 60 mins, and there were 3 sections.
Level of difficulty: Moderate.
This round was of 80 mins, and there were 2 sections.
Level of difficulty: High.
1.Write a program to perform Binary search on an array of N numbers.
#include //header files
int binarySearch(int[], int, int, int);
int main() //main function
{
int arr[10] = {9, 26, 33, 47, 53, 60, 75, 80, 86, 99};
int item, location = -1;
printf("Enter the item which you want to find ");
scanf("%d",&item);
location = binarySearch(arr, 0, 9, item);
if(location != -1) //looping logic
{
printf("Item found at location %d",location); //printing the element
}
else
{
printf("Item not found");
}
return 0;
}
int binarySearch(int a[], int start, int last, int item)
{
int mid;
if(last >= start)
{
mid = (start + last)/2;
if(a[mid] == item){
return mid+1;
}
else if(a[mid] < item){
return binarySearch(a,mid+1,last,item);
}
else{
return binarySearch(a,start,mid-1,item);
}
}
return -1;
}
2.Write a program to perform Merge sort on an array of N numbers.
Next he asked me a lot of questions on Machine Learning. All my projects were on Machine Learning and so they asked about it a lot.
Next they questioned me on ReactJS as I had mentioned it in my resume.
The HR Round was like a document verification round only. The questions asked in this round included:-
To read other companies interview experiences, visit Interview Dashboard: https://prepinsta.com/interview-experience/
Cognizant visited out campus for hiring. All batches were eligible for this drive. There were 3 rounds that were conducted.
This round was of 60 mins, and there were 3 sections.
Level of difficulty: Moderate.
This round was of 80 mins, and there were 2 sections.
Level of difficulty: High.
1.Write a program for Heap sort.
#include<stdio.h> // including library files
int temp;
void heapify(int arr[], int size, int i)//declaring functions
{
int max = i;
int left = 2*i + 1;
int right = 2*i + 2;
if (left < size && arr[left] >arr[max])
max= left;
if (right < size && arr[right] > arr[max])
max= right;
if (max!= i)
{
// performing sorting logic by using temporary variable
temp = arr[i];
arr[i]= arr[max];
arr[max] = temp;
heapify(arr, size, max);
}
}
void heapSort(int arr[], int size)// providing definition to heap sort
{
int i;
for (i = size / 2 - 1; i >= 0; i--)
heapify(arr, size, i);
for (i=size-1; i>=0; i--)
{
// swaping logic
temp = arr[0];
arr[0]= arr[i];
arr[i] = temp;
heapify(arr, i, 0);
}
}
void main() // defining main()
{
int arr[] = {58, 134, 3, 67, 32, 89, 15, 10,78, 9};
// array initializing with their elements.
int i;
int size = sizeof(arr)/sizeof(arr[0]);
heapSort(arr, size);
printf("printing sorted elements\n"); // printing the sorted array
for (i=0; i<size; ++i)
printf("%d\n",arr[i]);
}
2.What are the different data types in Python?
Different data types include:- int, float, double, string, dictionary, tuple, list.
3.What are the OOPS concepts?
4.What are the different types of Inheritance?
5.Create an empty class using pass keyword.
6.Write a code to print first 10 elements of Fibonacci series.
7.Explain your projects.
8.What was your learning experience in your internships?
There was also an HR Round which was mostly around document and document verification.
I got to know about Cognizant GenC off-campus recruitment through the Prepinsta portal. After 15-20days, I received an email stating my resume was shortlisted for the assessment process.
So this round was an elimination round divided into three sections:
Cognizant take assessments on a specific platform named Superset.
The level of difficulty was moderate.
The time allotted for this round was 100mins
Just like the Aptitude assessment, this round was also an elimination round divided into three sections:
The level of difficulty was moderate. The time allotted for this round was 45mins
After a week I received an email about being shortlisted for the next round which was the Interview Round.
My technical round timing was around 10 am. The interviewer was on time and it was like a friendly discussion.
Later I was asked to solve two coding questions also.
// Time Complexity : O(N^2)
// Space Complexity : O(1)
class Main
{
static void bubbleSort(int a[])
{
int len = a.length; // calculating the length of array
for (int i = 0; i < len-1; i++)
for (int j = 0; j < len-i-1; j++)
if (a[j] > a[j+1]) //comparing the pair of elements
{
// swapping a[j+1] and a[i]
int temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
/* Prints the array */
static void printArray(int a[])
{
int len = a.length;
for (int i = 0; i < len; i++)
System.out.print(a[i] + " "); //printing the sorted array
System.out.println();
}
// Main method to test above
public static void main(String args[])
{
int arr[] = {64, 34, 25, 12, 22, 11, 90};
bubbleSort(arr);//calling the bubbleSort function
System.out.println("Sorted array");
printArray(arr); //calling the printArray function
}
} 2. Write a code to check whether a number is prime or not.
// Time Complexity : O(N)
// Space Complexity : O(1)
public class Main
{
public static void main (String[]args)
{
int n = 23;
checkPrime(n);
}
private static void checkPrime(int n) {
int count = 0;
// negative numbers, 0 and 1 are not prime
if (n < 2)
System.out.println ("The given is number " + n + " is not prime");
// checking the number of divisors b/w [1, n]
for (int i = 1; i <= n; i++)
{
if (n % i == 0)
count += 1;
}
// if count of divisors greater than 2 then its not prime
if (count > 2)
System.out.println ("The given is number " + n + " is not prime");
else
System.out.println ("The given is number " + n + " is prime");
}
} After clearing the Technical round, I was selected for the HR round.
It was just a document verification round along with some general HR questions such as,
After clearing the HR round successfully I got selected for the profile of GenC with the 4LPA package at Cognizant.
Thank you.
In PrepInsta Prime, we have created a customized Cognizant Interview Preparation Course. This course includes:-
To read more Interview Experiences of selected candidates, visit:
Answer:-
The Cognizant GenC exam is relatively easy. The candidates are expected to know about the basics of new and advanced technologies and basic to medium coding questions.
Answer:-
In Cognizant Interview questions are asked on new technologies like ML, AI. Along with that you can basic programming questions and coding questions. And some questions about Cognizant.
Answer:-
No. For whichever profile you have registered you will be shortlisted for that only. No upgrades are done.
Answer:-
Yes, coding questions are asked in Cognizant Interview.
You can practice coding questions here : Top 100 codes
Answer:-
GenC Elevate interview is a combination of Technical and HR Questions.
Answer:-
All the rounds in Cognizant are elimination rounds, and there is always the chance of getting rejected after the Interview stage.
Answer:-
The Cognizant Interview usually lasts for 30 minutes. But it varies as per candidates and interviewers.
Answer:-
Cognizant does a proper background check and document verification after hiring. And if there is any misinformation then they can reject the candidate.
Get Hiring Updates right in your inbox from PrepInsta
