keep elements in random positions keep the algorithm run in linear order keep the algorithm run in (log n) order keep elements in increasing or decreasing order Question # 2 of 10 ( Start time: 06:19:38 PM ) Total Marks: 1 Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree, Select correct option:

increasing order only decreasing order only heap order (log n) order Question # 5 of 10 ( Start time: 06:21:39 PM ) Total Marks: 1 A (an) _________ is a left-complete binary tree that conforms to the heap order Select correct option:

True False Question # 8 of 10 ( Start time: 06:23:26 PM ) Total Marks: 1 The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required? Select correct option:

16 10 32 31 Question # 9 of 10 ( Start time: 06:24:44 PM ) Total Marks: 1 In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis, Select correct option:

keep elements in random positions keep the algorithm run in linear order keep the algorithm run in (log n) order keep elements in increasing or decreasing order

Question # 2 of 10 ( Start time: 06:19:38 PM ) Total Marks: 1 Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree, Select correct option:

Question # 6 of 10 ( Start time: 06:22:04 PM ) Total Marks: 1 Divide-and-conquer as breaking the problem into a small number of Select correct option:

pivot Sieve smaller sub problems Selection

Question # 7 of 10 ( Start time: 06:22:40 PM ) Total Marks: 1 In Sieve Technique we do not know which item is of interest Select correct option:

True False

Question # 8 of 10 ( Start time: 06:23:26 PM ) Total Marks: 1 The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required? Select correct option:

16 10 32 31

Question # 9 of 10 ( Start time: 06:24:44 PM ) Total Marks: 1 In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis, Select correct option:

In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,Select correct option:lineararithmeticgeometricexponent

In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,Select correct option:T(n)T(n / 2)log nn / 2 + n / 4

The sieve technique is a special case, where the number of sub problems is just Select correct option:5many1few

In which order we can sort?Select correct option:increasing order onlydecreasing order onlyincreasing order or decreasing orderboth at the same time

The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required?Select correct option:16103231