Very slow way of sorting is ______.
a) Insertion sort b) Heap sort c) Bubble sort d) Quick sort
Insert elements in a priority queue implemented with sorted sequence is done in ____.
a) Insertion sort b) Selection sort c) Quick sort d) None of these.
Insert elements in a priority queue implemented with an unsorted sequence is done in ____.
a) Insertion sort b) Selection sort c) Quick sort d) None of these
Based on which concept priority queue is done?
a) Priority b) Queue c) Stack d) None of these.
The worst time complexity for insertion sorting is _______.
a) O(n2) b) O(n) c) O(n3) d) None of these.
Space complexity for bubble sort is ______.
a) O(1) b) O(n2) c) O(n) d) None of the above
The average time complexity of inserting sorting is ________
a) O(n) b) O(n2) c) O(2n2) d) None of these.
Bubble sort, selection sort and insertion sort are all _______.
a) O(n2) b) O(n) c) Both a and b d) None of these.
________ are the methods to deal with collision.
a) Rehashing b) Chaining c) Both a and b d) None of these
A _______ is an alternative method for representing a dictionary.
a) Heap table b) Hash table c) Priority queue d) None of these.
__________ 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.