Bharati Padhy, $\text{Gate}\; 2020, \text{GS-}624, \text{AIR-}1531, \text{Jest}\; (2020)\; \text{AIR-}75$

Some memory based questions:

  1. Brief intro
  2. DSA which area?
  3. Define complete binary tree?
  4. Heap data structure explain?
  5. In heap sort - how many times you do build heap?
  6. Heapify - with complexity?
  7. Build heap complexity?
  8. Definition of graph and tree?
  9. Definition of forest?
  10. Minimum number of trees require to make a forest?
  11. Difference between malloc and calloc?
  12. Null and void in C, can we compare them?
  13. In an array complexity to find an element which is neither min nor maximum?
  14. Complexity to find $2$ such elements which are neither min or max.
  15. Complexity to find a min element from an array.
  16. Applications of stack?
  17. Recurrence relation of linear search, Merge sort, Binary search with complexities.
  18. Explain $\Theta(n)$ in merge sort?
  19. Prove $\cos^2\theta+\sin^2\theta=1$
  20. Qsn on pigeon hole principal
  21. What is conditional probability?
  22. Bayes theorem?
posted in Interview Experience May 26, 2021
222 views
1
Like
0
Love
0
Haha
0
Wow
0
Angry
0
Sad