please alle option Choose the correct answer: i.As per the Master Theorem's, what is the value of d in the given recurre

[answerhappygod]

please alle option
Choose the correct answer:
i.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
ii. The best example for divide and conquer technique is
(a) sequential Search (c) brute force technique
(b) binary Search (d) euclid's
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 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
VII. 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
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.A Spanning tree with n vertices has exactly edges. (a) n (c)
n+1 (b) n-1 (d) 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
XI. Dynamic programming is a technique for solving problems with
sub- problems. (a) Overloading (b) Overlapping (c) overriding (d)
operator
XII 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
XIII.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
XIV.The time efficiency of Floyd's algorithm is (a) O(n) (c)
O(n²) (b) O(n³) (d) O(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