TCS Dispatch Executive Interview Questions and Answers

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...read more

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...read more