Dynamic programming uses a top-down approach?
a) True
b) False
c) NA
d) NA
Dynamic programming algorithms need to store the results of intermediate sub-problems?
a) True
b) False
c) NA
d) N/A
Memorization is?
a) To store previous results for future use
b) To avoid this unnecessary repetitions by writing down the results of recursive calls and looking them up again if we need them later
c) To make the process accurate
d) None of the above
Merge sort is a stable algorithm but not an in-place algorithm?
a) True
b) False
c) N/A
d) NA
Which of the following sorting algorithms is stable?
(i) Merge sort (ii) Quick sort (iii) Heap sort (iv) Counting Sort?
a) Only I
b) Only ii
c) Both i and ii
d) Both iii and iv
It requires more complicated data structures, Prim's algorithm for
a minimum spanning tree is better than Kruskal's when the graph has a large
number of vertices?
a) True
c) False
c) NA
d) NA
