i
Cognizant
Filter interviews by
My favorite technology is artificial intelligence.
AI has the potential to revolutionize various industries
It can automate repetitive tasks and improve efficiency
AI can also help in making better decisions by analyzing large amounts of data
Examples include chatbots, image recognition, and predictive analytics
Virtual DOM is a lightweight copy of the actual DOM used for efficient updates.
Virtual DOM is a concept where a lightweight copy of the actual DOM is created.
ReactJS uses it to efficiently update the UI without re-rendering the entire page.
Virtual DOM compares the previous and current states and updates only the necessary changes.
This results in faster rendering and better performance.
Example: When a user types in...
Poison distribution refers to the spread of toxic substances through various means.
Poison distribution can occur through intentional or accidental means.
Examples include the distribution of poison through food or water, or the release of toxic chemicals into the environment.
Poison distribution can have serious health consequences and may require immediate medical attention.
Prevention measures such as proper storag...
PCA stands for Principal Component Analysis. It is a statistical technique used for dimensionality reduction.
PCA is used to identify patterns in data and reduce the number of variables in a dataset.
It works by transforming the original variables into a new set of variables called principal components.
These principal components are ordered by the amount of variance they explain in the data.
PCA is commonly used in f...
What people are saying about Cognizant
Clustering algorithm groups similar data points together based on their characteristics.
Clustering is an unsupervised learning technique.
It can be used for customer segmentation, image segmentation, etc.
K-means, hierarchical clustering, and DBSCAN are popular clustering algorithms.
The choice of algorithm depends on the data and the problem at hand.
Gradient descent is an optimization algorithm used to minimize the cost function of a machine learning model.
Start with an initial guess for the model parameters
Calculate the gradient of the cost function with respect to each parameter
Update the parameters in the opposite direction of the gradient
Repeat until convergence or a maximum number of iterations is reached
Creating a machine learning model involves data preparation, model selection, training, evaluation, and deployment.
Data preparation involves cleaning, transforming, and splitting the data into training and testing sets.
Model selection involves choosing the appropriate algorithm and hyperparameters for the problem.
Training the model involves feeding the training data to the algorithm and adjusting the parameters to...
Program to perform Merge sort on an array of N numbers.
Divide the array into two halves recursively
Sort the two halves using merge sort
Merge the two sorted halves
Repeat until the entire array is sorted
Time complexity: O(nlogn)
Regularization techniques are used to prevent overfitting in machine learning models.
L1 regularization (Lasso)
L2 regularization (Ridge)
Elastic Net regularization
Dropout regularization
Early stopping
Data augmentation
Batch normalization
Program to perform Binary search on an array of N numbers.
Sort the array in ascending order
Set low and high variables to the first and last index of the array respectively
Calculate the mid index as (low+high)/2
If the element at mid index is equal to the search element, return mid
If the element at mid index is less than the search element, set low to mid+1
If the element at mid index is greater than the search eleme...
I applied via Campus Placement and was interviewed in Nov 2024. There was 1 interview round.
I applied via Campus Placement and was interviewed in Sep 2021. There were 3 interview rounds.
Round duration - 180 minutes
Round difficulty - null
This Round consisted of 30 MCQs from various topics like OOPS,JAVA,HTML,CSS,PL/SQL, Operating Systems, DBMS.
After MCQs, there were 4 coding questions and 2 SQL questions.
The difficulty of the first 2 questions was easy and that of 3rd and 4rth was medium.
These questions were from various programming topics such as greedy, dynamic programming, graphs etc.
The entire test duration was 3 hours.
They asked me coding questions and questions about my project. Since most of my projects were based on Machine Learning, they asked a few ML based question as well.
Program to perform Binary search on an array of N numbers.
Sort the array in ascending order
Set low and high variables to the first and last index of the array respectively
Calculate the mid index as (low+high)/2
If the element at mid index is equal to the search element, return mid
If the element at mid index is less than the search element, set low to mid+1
If the element at mid index is greater than the search element, s...
Program to perform Merge sort on an array of N numbers.
Divide the array into two halves recursively
Sort the two halves using merge sort
Merge the two sorted halves
Repeat until the entire array is sorted
Time complexity: O(nlogn)
Creating a machine learning model involves data preparation, model selection, training, evaluation, and deployment.
Data preparation involves cleaning, transforming, and splitting the data into training and testing sets.
Model selection involves choosing the appropriate algorithm and hyperparameters for the problem.
Training the model involves feeding the training data to the algorithm and adjusting the parameters to mini...
Regularization techniques are used to prevent overfitting in machine learning models.
L1 regularization (Lasso)
L2 regularization (Ridge)
Elastic Net regularization
Dropout regularization
Early stopping
Data augmentation
Batch normalization
Poison distribution refers to the spread of toxic substances through various means.
Poison distribution can occur through intentional or accidental means.
Examples include the distribution of poison through food or water, or the release of toxic chemicals into the environment.
Poison distribution can have serious health consequences and may require immediate medical attention.
Prevention measures such as proper storage and...
Gradient descent is an optimization algorithm used to minimize the cost function of a machine learning model.
Start with an initial guess for the model parameters
Calculate the gradient of the cost function with respect to each parameter
Update the parameters in the opposite direction of the gradient
Repeat until convergence or a maximum number of iterations is reached
Clustering algorithm groups similar data points together based on their characteristics.
Clustering is an unsupervised learning technique.
It can be used for customer segmentation, image segmentation, etc.
K-means, hierarchical clustering, and DBSCAN are popular clustering algorithms.
The choice of algorithm depends on the data and the problem at hand.
Virtual DOM is a lightweight copy of the actual DOM used for efficient updates.
Virtual DOM is a concept where a lightweight copy of the actual DOM is created.
ReactJS uses it to efficiently update the UI without re-rendering the entire page.
Virtual DOM compares the previous and current states and updates only the necessary changes.
This results in faster rendering and better performance.
Example: When a user types in a se...
Bounding methods in React are used to limit the scope of a component's updates.
Bounding methods include shouldComponentUpdate, getSnapshotBeforeUpdate, and componentDidUpdate.
shouldComponentUpdate allows a component to decide if it should update based on changes in props or state.
getSnapshotBeforeUpdate allows a component to capture information before a change is made to the DOM.
componentDidUpdate is called after a com...
This was more of a document verification round.
I enjoy reading, hiking, and playing board games.
Reading: I love getting lost in a good book, especially mysteries and thrillers.
Hiking: I enjoy exploring new trails and being out in nature.
Board games: I like playing strategy games with friends and family, like Settlers of Catan and Ticket to Ride.
I struggled to win my first hackathon due to lack of experience and technical skills.
I had limited knowledge of coding and programming languages.
I struggled to come up with a unique and innovative idea.
I had difficulty working in a team and communicating my ideas effectively.
I lacked confidence in my abilities and felt intimidated by the competition.
However, I learned from my mistakes and used the experience to improve...
My favorite technology is artificial intelligence.
AI has the potential to revolutionize various industries
It can automate repetitive tasks and improve efficiency
AI can also help in making better decisions by analyzing large amounts of data
Examples include chatbots, image recognition, and predictive analytics
I applied via Campus Placement and was interviewed in Jul 2021. There were 4 interview rounds.
Our project uses technologies such as Python, Django, React, and PostgreSQL. I have also worked with Java and AngularJS.
Python is used for backend development
Django is used as a web framework
React is used for frontend development
PostgreSQL is used as the database management system
I have worked with Java for Android app development
I have worked with AngularJS for frontend development
I applied via Campus Placement and was interviewed in Sep 2021. There were 3 interview rounds.
I appeared for an interview in Dec 2020.
Round duration - 120 Minutes
Round difficulty - Medium
We have aptitude, reasoning and verbal.
Given an array consisting of 'N' positive integers where each integer is either 0, 1, or 2, your task is to sort the given array in non-decreasing order.
Each input st...
Sort an array of positive integers (0, 1, 2) in non-decreasing order.
Iterate through the array and count the occurrences of 0, 1, and 2.
Update the array with the counts of each element in non-decreasing order.
Print the sorted array for each test case.
Round duration - 60 minutes
Round difficulty - Easy
Advanced Coding round
Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...
Calculate minimum steps for a Knight to reach target position on a chessboard.
Use BFS algorithm to find shortest path from Knight's starting position to target position.
Consider all possible moves of the Knight on the chessboard.
Keep track of visited positions to avoid revisiting them.
Return the minimum number of moves required for the Knight to reach the target position.
Round duration - 60 Minutes
Round difficulty - Medium
I got the link a day before and my interview was scheduled at 6Pm.
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
The task is to find the total number of ways to make change for a specified value using given denominations.
Create a dynamic programming table to store the number of ways to make change for each value up to the target value.
Iterate through each denomination and update the table accordingly.
The final answer will be the value in the table at the target value.
Consider edge cases like when the target value is 0 or when the...
Tip 1 : confidence is most important.
Tip 2 : explaining projects plays a key role.
Tip 1 : you should be very clear what you have written in your resume.
Tip 2 : projects should be very clear
I applied via Company Website and was interviewed in Jan 2021. There were 3 interview rounds.
In five years, I envision myself as a senior analyst, leading projects and mentoring junior team members while driving impactful data-driven decisions.
I aim to develop expertise in advanced analytics tools, such as Python and R, to enhance data modeling capabilities.
I plan to take on leadership roles in projects, guiding teams to deliver actionable insights that align with business goals.
I aspire to mentor junior analy...
To debug a particular program without affecting others, use breakpoints and step through the code.
Set a breakpoint in the program you want to debug
Step through the code using a debugger to identify the issue
Use logging statements to track the flow of the program
Check the call stack to see which functions are being called
Use conditional breakpoints to stop the program at specific points
I applied via Campus Placement and was interviewed before Feb 2020. There were 4 interview rounds.
If and Switch Case statements are used for conditional branching in programming.
If statements are used for simple conditional branching.
Switch Case statements are used for multiple conditional branching.
If statements are more flexible than Switch Case statements.
Switch Case statements are more efficient than If statements for large number of conditions.
If statements can be nested, but Switch Case statements cannot.
Exam...
Yes, algorithms and pseudocodes are still important in IT Services.
Algorithms are used in various fields of IT such as machine learning, data analysis, and cryptography.
Pseudocodes are used to plan and design algorithms before coding them.
Understanding algorithms and pseudocodes is essential for software engineers to write efficient and optimized code.
Examples of algorithms include sorting algorithms, search algorithms...
Yes, I am comfortable using both CLIs and IDEs for my daily tasks.
I have experience using various CLIs such as Git Bash, Windows Command Prompt, and Terminal on macOS.
I am proficient in using IDEs such as Visual Studio Code, Eclipse, and IntelliJ IDEA.
I understand the benefits and drawbacks of both CLIs and IDEs and can choose the appropriate tool for the task at hand.
Some of the top questions asked at the Cognizant GenC Next interview for freshers -
based on 1 interview experience
Difficulty level
Duration
Associate
73k
salaries
| ₹5.3 L/yr - ₹12.5 L/yr |
Programmer Analyst
56.2k
salaries
| ₹3.5 L/yr - ₹7.3 L/yr |
Senior Associate
55.1k
salaries
| ₹9.7 L/yr - ₹23.4 L/yr |
Senior Processing Executive
29.8k
salaries
| ₹2.3 L/yr - ₹6.5 L/yr |
Technical Lead
19k
salaries
| ₹6 L/yr - ₹21 L/yr |
TCS
Infosys
Wipro
Accenture