XI. Dynamic programming is a technique for solving problems with sub- problems. (a) Overloading (b) Overlapping (c) over

[answerhappygod]

Xi Dynamic Programming Is A Technique For Solving Problems With Sub Problems A Overloading B Overlapping C Over 1 (32.04 KiB) Viewed 50 times

xvi.As per the Master Theorem's, what is the value of d in the
given recurrence relation T(n) 4T(n/2)+ 1000n2?
(a) 1 (c) 3 (b) 2 d)4
xvii. The best example for divide and conquer technique
is
(a) sequential Search (c) brute force technique
(b) binary Search (d) euclid's

Xi Dynamic Programming Is A Technique For Solving Problems With Sub Problems A Overloading B Overlapping C Over 2 (65.39 KiB) Viewed 50 times

XI. Dynamic programming is a technique for solving problems with sub- problems. (a) Overloading (b) Overlapping (c) overriding (d) operator XII. In Tower of Hanoi puzzle to move 6 disc from pegl to peg3 by using peg2 the number of moves required are (a) 61 (c) 62 (d) 64 (b) 63 XIII. Quick Sort is a perfect example of a successful application of the technique. (a) Brute Force (c) Divide & Conquer (b) Decrease and Conquer (d) Dynamic Programming XIV. A Spanning tree with n vertices has exactly edges. (a) n (c) n+1 (b) n-1 (d) n² XV. Analysis of algorithms means to investigate the algorithm's efficiency with respect to Resources: like running time and (a) Speed (b) space (b) Hardware (d) Input

1. Choose the correct answer: I. The bad symbol shift dI is computed by the Boyer-Moore algorithm which can be expressed by the formula of (a) dl= max {tl (c) *k,1} (b) dl= max {t1(c)-k, 1} (b) dl= max {tl (c) + k, 1 } (d) dl= max {t1(c) - k} II. Which of the following is not an Algorithm design technique. (a) Brute Force (c) Divide & Conquer (b) Dynamic Programming (d) Hashing III. The Decrease-and-Conquer technique is used in (a) Bubble Sort (b) String Matching (c) Insertion Sort (d) Heap IV. O(g(n)) stands for set of all functions with a (a) Larger or same order of growth as g(n) (b) Smaller or same order of growth as g(n) (c) Same order of growth as g(n) (d) Smaller order of growth as g(n) V. It is convenient to use a to trace the operation of Depth First Search. (a) Stack (b) Array (c) Queue (d) String VI. In Brute Force String matching, while pattern is not found and the text is not yet exhausted, realign one position to the right. (a) Left (c) Right (d) String (b) Pattern VII. The recurrence relation of Binary Search in worst-case is (a) T(n)=2T(n/2) + (n-1) (c) T(n) = 2T(n/2) + n (d) T(n) = T(n/2) + n (b) T(n) = T(n/2) +1 VIII. The time efficiency of the Krushkal's algorithm is (a) O(E log E) (c) O(E log |V) (b) O(E| log |V) (d) O(E log |V²) IX. The time efficiency of Floyd's algorithm is (a) O(n) (c) O(n²) (b) O(n³) (d) O(n*) X. In a Horspool's algorithm, when searching a pattern with some text, if there is a mismatch occurs we need to shift the pattern to (a) Left Position (c) Right Position (b) Stop the Process (d) continue with another occurrence