Cognizant Program Analyst Interview Questions, Process, and Tips

Round duration - 60 Minutes
Round difficulty - Medium

Timing - 1hr
Environment- Skype
Interviewer- with 10-25 year experience

Q1. 
String Palindrome Verification
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
Input:
The input is a single string without any leading or trailing...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Nth Fibonacci Number Problem Statement
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.
Input:
...read more
Ans. 
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...read more
Answered by AI
Add your answer

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.

Q1. What are indexes in SQL?
Ans. 
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
Answered by AI
Add your answer
Q2. 
Sum of Digits Problem Statement
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 ...read more
Ans. 
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
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Q1. 
Binary Palindrome Check
Given an integer N, determine whether its binary representation is a palindrome.
Input:
The first line contains an integer 'T' representing the number of test cases. 
The next 'T'...read more
Ans. 
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
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium