The recurrence relation of Tower of Hanoi is given below T(n) ={1ifn=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?
a) 10
b) 16
c) 31
d) 32
A heap is a left-complete binary tree that conforms to the
a) increasing order only
b) decreasing order only
c) heap order
d) (log n) order
Sieve Technique can be applied to selection problem?
a) True
b) False
c) NA
d) N/A
Knapsack problem is called a "0-1" problem, because?
a) Each item must be entirely accepted or rejected
b) One item must be entirely accepted or rejected
c) Zero item must be entirely accepted or rejected
d) None of these
Heaps can be stored in arrays without using any pointers; this is due to the...... nature of the binary tree.
a) left-complete
b) right-complete
c) tree nodes
d) tree leaves
What type of instructions Random Access Machine (RAM) can execute?
a) Algebraic and logic
b) Geometric and arithmetic
c) Arithmetic and logic
d) Parallel and recursive
