DAA - MCQs - Nov 02, 2020

    

 

SRI LAKSHMI COLLEGE OF ARTS & SCIENCE
DEPARTMENT OF COMPUTER SCIENCE

II B. Sc., CS

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

 DAA – MCQ6

(01) Fractional knapsack problem is also known as __________

(A) 0/1 knapsack problem

(B) Continuous knapsack problem

(C) Divisible knapsack problem

(D) Non continuous knapsack problem

(02) Fractional knapsack problem is solved most efficiently by which of the following algorithm?

(A) Divide and conquer                                      (B) Dynamic programming

(C) Greedy algorithm                                (D) Backtracking

 (03) Which of the problems cannot be solved by backtracking method?

(A) n-queen problem                                 (B) Subset sum problem

(C) Hamiltonian circuit problem              (D) Travelling salesman problem

 (04) In how many directions do queens attack each other?

(A) 1                                                           (B) 2

(C) 3                                                           (D) 4

 (05) Of the following given options, which one of the following does not provides an optimal solution for 8-queens problem?

(A) (5,3,8,4,7,1,6,2)                                    (B) (1,6,3,8,3,2,4,7)

(C) (4,1,5,8,6,3,7,2)                                    (D) (6,2,7,1,4,8,5,3)

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

Answers for Oct 31, 2020 (DAA – MCQ5)

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