Tcil Software Trainee Interview Questions and Answers

1st round some apt qns,some prgramming qns are they asked

Q1. C depth concepts and some prgram
Add your answer

Q1. Some DSA questions they asked
Add your answer

Q1. Reverse a linked list.
Add your answer
Q2. Merge sort on a array/
Add your answer

Easy-medium level and it included two coding questions and some technical questions

Q1. How are structures and classes stored?
Ans. 
Structures and classes are stored in memory as a combination of data members and member functions.
• Structures and classes are stored in memory as a combination of data members and member functions.

• Data members of a structure or class are stored in contiguous memory locations.

• Member functions of a class are stored separately in memory and are shared among all instances of the class.

• Pointers to member functions are used t...read more
Answered by AI
Add your answer
Q2. What is final and finalize?
Ans. 
final is a keyword in Java used to restrict inheritance, overriding, and modification. finalize is a method used for cleanup operations before an object is garbage collected.
• final keyword is used to declare constants, prevent inheritance by marking a class as final, and prevent method overriding by marking a method as final

• finalize method is called by the garbage collector before an object is destroyed

• Example: final in...read more
Answered by AI
Add your answer

Q1. Merge two linked list..
Ans. 
Merging two linked lists involves combining the elements of both lists into a single sorted list.
• Create a new linked list to store the merged list

• Compare the values of the nodes from both lists and add the smaller value to the merged list

• Move the pointer of the list with the smaller value to the next node

• Repeat the comparison and addition until both lists are exhausted

• If one list is exhausted, append the remaining node
Answered by AI
Add your answer
Q2. Program for selection sort
Ans. 
Selection sort is a simple sorting algorithm that repeatedly selects the minimum element from an unsorted portion of the array and swaps it with the first element.
• Iterate through the array and find the minimum element

• Swap the minimum element with the first element

• Repeat the process for the remaining unsorted portion of the array
Answered by AI
Add your answer
Q3. What is critical section
Ans. 
A critical section is a part of a program where shared resources are accessed and must be protected from concurrent access.
• Critical sections are used to prevent race conditions and ensure data integrity.

• They are typically protected using locks or other synchronization mechanisms.

• Only one thread can execute the critical section at a time.

• Examples include accessing a shared database, updating a global variable, or modify
Answered by AI
Add your answer

Q1. Questions about project in depth
Add your answer

Q1. Where do you see yourself in 5 years
Add your answer

Q1. Hashmap working Sql joins Java 8 features
Add your answer

Q1. Roles and responsibilities
Add your answer

It was a good experience in aptitude

Q1. They are asking simple questions like oops , spring bean,how to avoid duplication values in array and in order
Add your answer

Q1. General discussion
Add your answer

It is easy and conducted in aon platform

It is easy ques from array and string topic

Q1. Asked questions from resume and coding que on stack umplented in queue with dbms concepts
Add your answer