DAA (MCQs): Nov 04, 2020

      

 

SRI LAKSHMI COLLEGE OF ARTS & SCIENCE
DEPARTMENT OF COMPUTER SCIENCE

II B. Sc., CS

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

 DAA – MCQ8

(01) Binary Search can be categorized into which of the following?

(A) Brute Force technique                         (B) Divide and conquer

(C) Greedy algorithm                                (D) Dynamic programming

(02) Given an array arr = {15,66,177,288,939} and key = 288; How many iterations are done until the element is found by using Binary Search?

(A) 4                                                           (B) 3

(C) 2                                                           (D) 1

(03) Which of the following algorithm does not divide the list?

(A) Merge Sort                                           (B) Binary Search

(C) Linear Search                                      (D) Quick Sort             

(04) The following sorting algorithms maintain two sub-lists, one sorted and one to be sorted:

1. Selection Sort            2. Insertion Sort            3. Merge Sort

(A) 1 and 2 only                                        (B) 3 only

(C) 1, 2 and 3                                             (D) 1 and 3 only

(05) If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then

(A) we will get a different spanning tree.

(B) we will get the same spanning tree.

(C) spanning will have less edges.

(D) spanning will not cover all vertices.

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

Answers for Nov 03, 2020 (DAA – MCQ7)

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