TCS System Engineer Specialist Interview Questions and Answers

Round duration - 50 minutes
Round difficulty - Medium

Consisted of two parts- Verbal and quantitative aptitude with 1 mark for each correct answer and -0.33 mark for each wrong answer.

Round duration - 60 minutes
Round difficulty - Medium

Took place at 10 a.m morning.
Consisted of 2 questions which has to solved in 1 hour. First problem had to be solved to view the next question. Both were easy implementation adhoc problems.

Q1. 
Most Cost Efficient Car Problem Statement
Given the cost and operational details for both 'Petrol' and 'Diesel' cars, determine which type is more cost-efficient for a period of exactly 6 months. Output a...read more
Ans. 
Determine the most cost-efficient car (Petrol or Diesel) for a 6-month period based on given details.
• Calculate total cost for 6 months for both Petrol and Diesel cars

• Compare the total costs to determine which option is more cost-efficient

• Output '0' for Petrol, '1' for Diesel, or '-1' if both are equally efficient
Answered by AI
Add your answer
Q2. 
Constellation Identification Problem
Given a matrix named UNIVERSE with 3 rows and 'N' columns, filled with characters {#, *, .}, where:
• '*' represents stars.
• '.' represents empty space.
• '#' repre...read more
Ans. 
Identify constellations shaped like vowels within a matrix filled with characters {#, *, .}.
• Iterate through the matrix to find 3x3 matrices that form the shape of vowels.

• Check for vowels 'A', 'E', 'I', 'O', 'U' in the 3x3 matrices.

• Print the vowels found in each galaxy separated by '#'.
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Took place at 1 pm at noon and I was very confident. Three interviewers were present- One technical , One managerial and One HR .
Initially, the interviewers introduced themselves and asked me to introduce myself.
Then, I was asked about my project.

Q1. 
Word Break II Problem Statement
Given a non-empty string 'S' containing no spaces and a dictionary of non-empty strings, generate and return all possible sentences by adding spaces in the string 'S', such...read more
Ans. 
The problem involves generating all possible sentences by adding spaces to a given string using words from a dictionary.
• Use backtracking to generate all possible combinations of words from the dictionary to form sentences.

• Recursively try adding each word from the dictionary to the current sentence until the entire string is formed.

• Check if the current word is a prefix of the remaining string to optimize the backtrackin...read more
Answered by AI
Add your answer