DAA (MCQs): Nov 03, 2020

     

 

SRI LAKSHMI COLLEGE OF ARTS & SCIENCE
DEPARTMENT OF COMPUTER SCIENCE

II B. Sc., CS

DESIGN & ANALYSIS OF ALGORITHMS (BSCS33) – MCQs – 03/11/2020

 DAA – MCQ7

(01) Under what condition any set A will be a subset of B?

(A) If all elements of set B are also present in set A

(B) If all elements of set A are also present in set B

(C) If A contains more elements than B

(D) If B contains more elements than A

(02) Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?

(A) Branch and bound                              (B) Iterative improvement

(C) Divide and conquer                                      (D) Greedy algorithm

(03) Which of the following problems is similar to that of a Hamiltonian path problem?

(A) Knapsack problem                              (B) Closest pair problem

(C) Travelling salesman problem             (D) Assignment problem

(04) Merge sort is preferred for ____

(A) Stacks                                                            (B) Queues

(C) Linked lists                                                    (D) Arrays

(05) Which of the following is not applicable for binary search?

(A) To find the lower/upper bound in an ordered sequence

(B) Union of intervals                                         (C) Debugging

(D) To search in unordered list

<<<<<ANSWERS WILL BE GIVEN TOMORROW>>>>>

Answers for Nov 03, 2020 (DAA – MCQ6)

(01) B                   (02) C                   (03) D         (04) C         (05) B