i
Cognizant
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I was interviewed in Nov 2020.
Round duration - 60 Minutes
Round difficulty - Medium
Timing - 1hr
Environment- Skype
Interviewer- with 10-25 year experience
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
The input is a single string without any leading or trailing...
A program to determine if a given string is a palindrome considering only alphanumeric characters.
Remove non-alphanumeric characters from the input string.
Compare the string with its reverse to check for palindrome.
Return true if the string is a palindrome, false otherwise.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iteratively calculate F(n) using the formula F(n) = F(n-1) + F(n-2).
Optimize the solution to have a time complexity of O(N) by storing and reusing previously calculated Fibonacci numbers.
Ensure the...
Tip 1 : First clear programming fundamentals
Tip 2 : Then practice coding questions
Tip 3 : Now you can go with Data Structures and Algorithms
Tip 4 : You can prepare SQL daily 1-2 hr
Tip 1 : Only Mention technologies you have worked on.
Tip 2 : Highlight quick learner, hard working personality in resume
I applied via Referral and was interviewed in Jan 2021. There were 3 interview rounds.
I was interviewed before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Medium
It was an online round in proctored mode during day time. There was time duration allotted for each section of questions to be attempted.
Indexes in SQL are data structures that improve the speed of data retrieval operations on a database table.
Indexes are created on columns in a table to quickly retrieve rows based on the values in those columns.
They can be unique, allowing only unique values to be stored in the indexed column.
Examples of indexes include primary keys, which uniquely identify each row in a table, and foreign keys, which establish relatio
Given an integer 'N', continue summing its digits until the result is a single-digit number. Your task is to determine the final value of 'N' after applying this operation ...
Given an integer 'N', find the final single-digit value by summing its digits iteratively.
Iteratively sum the digits of the given integer until the result is a single-digit number
Output the final single-digit integer for each test case
Follow the constraints provided in the problem statement
Round duration - 120 minutes
Round difficulty - Medium
Given an integer N
, determine whether its binary representation is a palindrome.
The first line contains an integer 'T' representing the number of test cases.
The next 'T'...
Implement a function to determine if the binary representation of a given integer is a palindrome.
Convert the integer to binary representation
Check if the binary representation is a palindrome by comparing it with its reverse
Return true if it is a palindrome, false otherwise
Round duration - 30 Minutes
Round difficulty - Medium
Tip 1 : Focus on your domain like ML/Web Development etc.
Tip 2 : Focus on internship
Tip 1 : Mention atleast 3 projects
Tip 2 : Briefly mention all technologies,libraries and framework worked on
Tip 3 : Also mention other area of interests
What people are saying about Cognizant
I applied via Company Website and was interviewed before Oct 2019. There were 5 interview rounds.
Cognizant interview questions for designations
I applied via Campus Placement and was interviewed before Oct 2019. There were 4 interview rounds.
Get interview-ready with Top Cognizant Interview Questions
I am a dedicated and detail-oriented Program Analyst with a strong background in data analysis and project management.
I have a Bachelor's degree in Business Administration with a focus on analytics.
I have experience in developing and implementing data-driven strategies to improve program efficiency.
I am proficient in various data analysis tools such as Excel, SQL, and Tableau.
I have successfully managed multiple projec...
Paging and Segmentation are memory management techniques used by operating systems.
Paging divides memory into fixed-size pages and stores them in physical memory.
Segmentation divides memory into logical segments and stores them in physical memory.
Both techniques allow for efficient use of memory and protection of memory from unauthorized access.
Examples of operating systems that use paging and segmentation include Wind
Run time mapping between pages and frames is the process of mapping virtual memory pages to physical memory frames during program execution.
During program execution, the operating system maps virtual memory pages to physical memory frames to ensure efficient memory management.
This mapping is done dynamically and can change as the program runs.
The mapping is maintained in a page table, which is used by the operating sys...
Critical section is a part of code that must not be executed by more than one thread at a time.
It is used in multi-threaded programming to avoid race conditions.
It is usually protected by locks or semaphores.
Examples include updating shared variables or accessing shared resources.
It is important for ensuring data consistency and preventing deadlocks.
Code for critical section in C/Java/C++
Use mutex or semaphore to protect critical section
In C/C++, use pthread_mutex_lock() and pthread_mutex_unlock()
In Java, use synchronized keyword
In C++, use std::mutex and std::lock_guard
Ensure only one thread can access critical section at a time
Explanation of how sorting and searching complexities are derived.
Sorting and searching algorithms have different complexities depending on the algorithm used.
Sorting algorithms can be classified as O(n^2) or O(n log n) depending on the algorithm used.
Searching algorithms can be classified as O(n) or O(log n) depending on the algorithm used.
Complexities are derived by analyzing the number of operations required to comp...
I have traveled to over 20 countries and can speak 4 languages fluently.
Traveled to over 20 countries
Fluently speak 4 languages
Passionate about experiencing different cultures
One of my weaknesses is perfectionism, but I have learned to overcome it by setting realistic goals and prioritizing tasks.
Perfectionism
Setting realistic goals
Prioritizing tasks
I was interviewed before Jul 2016.
I was interviewed before Aug 2016.
I was interviewed in Oct 2016.
Cognizant should hire me because of my strong analytical skills, experience in program analysis, and ability to drive results.
I have a proven track record of successfully analyzing programs and identifying areas for improvement.
My strong analytical skills allow me to effectively gather and interpret data to make informed decisions.
I have experience in driving results through implementing strategic initiatives and colla...
An abstract class is a class that cannot be instantiated and is used as a base class for other classes.
An abstract class can have abstract and non-abstract methods.
Abstract methods have no implementation and must be implemented by the derived classes.
An abstract class can have constructors and fields.
An example of an abstract class is the Shape class, where the methods like area() and perimeter() are abstract and must ...
based on 4 interviews
4 Interview rounds
based on 209 reviews
Rating in categories
Associate
71.9k
salaries
| ₹0 L/yr - ₹0 L/yr |
Programmer Analyst
55.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
48.7k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Processing Executive
28.9k
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
17.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
Accenture