TCS Innovator Interview Questions and Answers

Topics: Statistics, Probability, Paragraphs, Verbal, Trains problem, Faulty measures, blood relation, etc. In short complete Qualitative, Quantitative, and Verbal ability

1 greedy type question
1 dynamic programming question
Total: 1 Hour Duration

Q1. 1. Questions on arrays and linked lists, and other Data Structures and Algorithms. 2. SQL, RDBMS, and N-RDBMS, E-R, Various keys and Query questions on pattern matching and joins, etc. 3. Python and its li...read more
Add your answer

Q1. 1. Tell me something about yourself 2. Why do you want to transition into the IT industry 3. Why you want to join TCS 4. TCS and TATA Group Ethics and Values 5. Are ok with the relocation anywhere in India...read more
Add your answer

Q1. Explain the working of QuickSort algorithm with an example
Ans. 
QuickSort is a divide-and-conquer algorithm that sorts an array by selecting a 'pivot' element and partitioning the other elements around the pivot.
• Select a pivot element from the array

• Partition the array into two sub-arrays: elements less than the pivot and elements greater than the pivot

• Recursively apply QuickSort to the sub-arrays

• Combine the sorted sub-arrays to get the final sorted array
Answered by AI
Add your answer
Q2. Given a 8X8 chessboard write a condition such that if 2 queens on the chessboard kill each other then return True else Return False
Ans. 
Check if two queens on a chessboard can kill each other
• Iterate through each queen's position and check if they are in the same row, column, or diagonal

• If any two queens are in the same row, column, or diagonal, return True

• Otherwise, return False
Answered by AI
Add your answer