__________ is a method of collision resolution in hash tables.
a) Open addressing b) Closed hashing c) Both a and b d) None of these.
________ time to perform insert,remove and search.
a) O(n) b) O(1) c) O(log n) d) None of these.
________ time to initialize hash table(b is the number of positions in hash table)
a) O(b) b) O(1) c) O(2) d) None of these.
The output that will be the maximum element and then you reheapify this between _______.
a) 0 and n-1 b) 0 and n-2 c) 0 and n d) 0 and n-3
In heap we are removing the elements in the zero position and swapping it at the _____ position.
a) nth b) n-1th c) n-2 th d) n-3th
You reserve the heap property the ______ should always be less then the parent nodes?
a) Child node b) Parent node c) Both a and b d) None of these.
The heap sort can be done in the order of ________ time?
a) n b) n logn c) 2n d) None of these.
The heap is represented in the _______ data structure?
a) Priority queue b) Stack c) Both a and b d) None of these.
An empty heap is said to be in a state of ________.
a) Underflow b) Overflow c) Empty d) Full
Insertion into a heap can be done in ________ time.
a) O(n) b) O(logN) c) O(2n) d) O(n2)
Heap and ________ are considered to be synonyms of each other.
a) Priority queue b) Stack c) Queue d) None of these
The accessing of location of elements in a heap is _______.
a) Distinct b) Random c) Optional d) None of these
A complete binary tree can be stored as an array using _______ traversal.
a) Level-order b) High order c) Tree order d) None of these.
________ is defined as the shortest distance between source and destination.
a) Shortest path b) Longest path c) Both a and b d) None of the above
Prim’s algorithm follows a _______ approach to find a minimum spanning tree.
a) Divide and conquer. b) Greedy c) Divide d) Rotation
A connected sub graph that connects all the vertices of the original connected graph is called _______.
a) The spanning tree b) Cyclic graph c) Acyclic graph d) None of these.