SRI LAKSHMI COLLEGE
OF ARTS & SCIENCE
DEPARTMENT OF COMPUTER SCIENCE
II B. Sc., CS
DESIGN & ANALYSIS OF ALGORITHMS (BSCS33)
– MCQs – 28/10/2020
DAA – MCQ2
(01) Dijkstra’s
shortest path is based on
(A)
Greedy Method (B)
Dynamic Programming
(C)
Divide & Conquer (D)
Depth – First Search
(02)
Binary search on sorted array is based on
(A)
Greedy Method (B)
Dynamic Programming
(C)
Divide & Conquer (D)
Depth – First Search
(03)
Backtracking search on a graph is based on
(A)
Greedy Method (B)
Dynamic Programming
(C)
Divide & Conquer (D)
Depth – First Search
(04)
Floyd Warshall Algorithm to complete all shortest path pairs is based on
(A)
Greedy Method (B)
Dynamic Programming
(C)
Divide & Conquer (D)
Depth – First Search
(05)
Backtracking algorithm is implemented by constructing a tree of choices called
as?
(A)
State-space tree (B)
State-chart tree
(C)
Node tree (D)
Backtracking tree
<<<<<ANSWERS WILL BE GIVEN TOMORROW>>>>>
Answers for Oct 27, 2020 (DAA – MCQ1)
|
(01) B (02) C (03) D (04) B (05) C (06) A (07)
C (08) A (09) B (10)
C
|
No comments:
Post a Comment