(A) increasing order only
(B) decreasing order only
(C) heap order
(D) (log n) order
Tag: Fundamentals of Computer Algorithms
Sieve Technique can be applied to selection problem?
(A) True
(B) False
(C) NA
(D) NA
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
What type of instructions Random access machine can execute?
(A) Geometric and arithmetic
(B) Algebraic and logic
(C) Arithmetic and logic
(D) Parallel and recursive
Due to left complete nature of binary tree, the heap can be stored in?
(A) Arrays
(B) Structures
(C) Link List
(D) Stack
An optimization problem is one in which you want to find?
(A) Not a solution
(B) An algorithm
(C) Good solution
(D) The best solution