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

Some memory based questions:

- Brief intro
- DSA which area?
- Define complete binary tree?
- Heap data structure explain?
- In heap sort - how many times you do build heap?
- Heapify - with complexity?
- Build heap complexity?
- Definition of graph and tree?
- Definition of forest?
- Minimum number of trees require to make a forest?
- Difference between malloc and calloc?
- Null and void in C, can we compare them?
- In an array complexity to find an element which is neither min nor maximum?
- Complexity to find $2$ such elements which are neither min or max.
- Complexity to find a min element from an array.
- Applications of stack?
- Recurrence relation of linear search, Merge sort, Binary search with complexities.
- Explain $\Theta(n)$ in merge sort?
- Prove $\cos^2\theta+\sin^2\theta=1$
- Qsn on pigeon hole principal
- What is conditional probability?
- Bayes theorem?