Divide-and-Conquer is as breaking the problem into a small number of?
a) Smaller Sub Problems
b) Pivot
c) Sieve
d) Solutions
If there are O(n2) entries in edit distance matrix then the total running time is?
a) O(1)
b) O(n^2)
c) O(n)
d) O(n log n)
Is it possible to sort without making comparisons?
a) True
b) False
c) NA
d) N/A
In Quick sort, we don't have the control over the sizes of recursive calls?
a) True
b) False
c) Less information to decide
b) Either true or false
When we call Heapify then at each level the comparison performed takes time?
a) It will take O(1)
b) Time will vary according to the nature of input data
c) It cannot be predicted
d) It will take O(log n)
What is the total time to heapify?
a) O(logn)
b) O(n log n)
c) O(n2 log n)
d) O(log2 n)
