DAA - MCQs - Oct 31, 2020

   

 

SRI LAKSHMI COLLEGE OF ARTS & SCIENCE
DEPARTMENT OF COMPUTER SCIENCE

II B. Sc., CS

DESIGN & ANALYSIS OF ALGORITHMS (BSCS33) – MCQs – 31/10/2020

 DAA – MCQ5

(01) 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.

(02) Which sorting algorithm is the best if the list i     s already in order?

(A) Quick sort                                                     (B) Merge sort

(C) Insertion sort                                                 (D) None of these

(03) How many distinct binary search trees can be formed which contains the integers 1, 2, 3?

(A) 6                                                                     (B) 5

(C) 4                                                                     (D) 3

(04) Find the odd out:

(A) Prim's Minimal Spanning Tree Algorithm

(B) Kruskal's Minimal Spanning Tree Algorithm

(C) Floyd-Warshall's All pair shortest path Algorithm

(D) Dijkstra's Minimal Spanning Tree Algorithm

(05) Which data structure allows deleting data elements from the front and adding at the back?

(A) Stack                                                             (B) Queue

(C) Binary-search tree                                         (D) Map

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

Answers for Oct 30, 2020 (DAA – MCQ4)

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