(A) At most four
(B) At least four
(C) Exact four
(D) Wrong
Tag: Fundamentals of Computer Algorithms
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) NA
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
Mergesort is a stable algorithm but not an in-place algorithm?
(A) True
(B) False
(C) NA
(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
(B) False
(C) NA
(D) NA
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and?
(A) There is explicit combine process as well to conquer the solutin
(B) No work is needed to combine the sub-arrays, the array is already sorted
(C) Merging the subarrays
(D) None of above