(A) 10
(B) 16
(C) 31
(D) 32
Category: Fundamentals of Algorithms Mcqs
Fundamentals of Algorithms Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Algorithms Mcqs section will help users to prepare mcqs of Computer Algorithms for various exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Algorithms portion from here.
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) 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