i
TCS
Filter interviews by
Need to give Aptitude test in beginning
Some simple programming like palindrome, Armstrong, pyramid, reverse of number in arrary
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
Heap sort works by first building a heap from the input array.
Then it repeatedly extracts the maximum element from the heap, and places it at the end of the sorted array.
The heap is then updated to exclude the extracted element, and the process is repeated until the heap is empty.
Heap sort has a worst-case and average time complexi...
I applied via Walk-in and was interviewed in Apr 2021. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Oct 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Jun 2021. There were 3 interview rounds.
Round 1 is quit easy , only verbal ability is little bit difficult. So anyone can easy to qualify round.
I applied via Company Website and was interviewed in Oct 2020. There were 3 interview rounds.
Recursion is a process in which a function calls itself. Inheritance is a mechanism in OOP where a class inherits properties of another class. Heap is a region of memory used for dynamic memory allocation.
Recursion can be used to solve problems that can be broken down into smaller sub-problems.
Inheritance allows for code reuse and helps in creating a hierarchy of classes.
Heap is used for dynamic memory allocation in la...
I applied via Naukri.com and was interviewed before Apr 2020. There were 5 interview rounds.
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
System Engineer
1.1L
salaries
| ₹1 L/yr - ₹9 L/yr |
IT Analyst
66.2k
salaries
| ₹5 L/yr - ₹15.9 L/yr |
AST Consultant
51.8k
salaries
| ₹8 L/yr - ₹25 L/yr |
Associate Consultant
30.3k
salaries
| ₹9 L/yr - ₹32 L/yr |
Assistant System Engineer
29.8k
salaries
| ₹2.2 L/yr - ₹5.8 L/yr |
Amazon
Wipro
Infosys
Accenture