CS301-Data Structures Quiz MCQS #Objective #Questions #Finalterm

1. If we want to find median of 50 elements, then after applying buildHeap method, how many times deleteMin method will be called?

- 5
- 25
- 35
- 50

- Sorted Sequential Array
- Stack
- Linked List
- Skip List

if(!heap->isEmpty())

checks

- Heap is empty
- Heap is full
- Heap is not empty
- Not a valid expression

- NLogN
- 2N
- N*N*N
- N

if(!heap->isFull())

check

- Heap is empty
- Heap is full
- Heap is not empty
- Heap is not full

- 55
- 51
- 50
- 49

- Quadratic probing
- Double hashing
- Cubic probing
- Linear probing

12 23 26 31 34 44 56 64 78 100

If we perform 4 deleteMin operations, the last element deleted is ___

- 31
- 34
- 44
- 56

- Two entries are identical except for their keys
- Two entries with different data have the exact same key
- Two entries with different keys have the same exact has value
- Two entries with the exact same key have different hash values

- Randomly remove walls until the entrance and exit cells are in the same set
- Removing a wall is the same as doing a union operation
- Do not remove a randomly chosen wall if the cells it separates are already in the same set
- All of the given