TCS Sde1 Interview Questions and Answers

Q1. What is your expected salary?
Add your answer

2 codes and some technical MCQs

Q1. Write program of Pascal Tree
Ans. 
Pascal Tree is a binary tree where each node represents a row of Pascal's Triangle.
• Create a binary tree with root node as 1

• For each level, create left child as previous level's value and right child as previous level's value + parent value

• Repeat until desired number of levels is reached
Answered by AI
Add your answer
Q2. Python language questions
Add your answer

Q1. Tell me about yourself, relocation and other general HR round questions
Add your answer

Q1. Java 8 features
Add your answer
Q2. Shallow copy and deep copy in java
Ans. 
Shallow copy creates a new object with references to the original object's data, while deep copy creates a new object with copies of the original object's data.
• Shallow copy only duplicates the references to the original object's data, not the data itself.

• Deep copy creates a new object with copies of the original object's data, ensuring that changes to the copied object do not affect the original object.

• In Java, shallow...read more
Answered by AI
Add your answer

Q1. Oops questions asked, all piller of oops, DSA basics
Add your answer

Was good and you get questions from various topics.
Apti
Basics of cs

Q1. Tell me about your self
Add your answer
Q2. Your strengths on technical subjects you have gine
Add your answer

Ppt and discussion - on all things in the company

Leetcode - 2 medium, 1 hard

Round duration - 140 minutes
Round difficulty - Medium

Test timing was at 2:00 pm , it was conducted in a college and the environment was good for the test. Camera was a primary part of test, so no suspicious activity.

Q1. 
Sum of Two Numbers Represented as Arrays
Given two numbers in the form of two arrays where each element of the array represents a digit, calculate the sum of these two numbers and return this sum as an ar...read more
Ans. 
Given two numbers represented as arrays, calculate their sum and return the result as an array.
• Iterate through the arrays from right to left, adding digits and carrying over if necessary

• Handle cases where one array is longer than the other by considering the remaining digits

• Ensure the final sum array does not have any leading zeros
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

The round was conducted at around 12 p.m. I was called at the college location and then it was conducted. The interviewer was quite polite and frank.

Round duration - 8 minutes
Round difficulty - Easy

This round was conducted right after finishing and clearing the technical round at the same place and on the same day.