DAA (MCQs): Nov 05, 2020

       

 

SRI LAKSHMI COLLEGE OF ARTS & SCIENCE
DEPARTMENT OF COMPUTER SCIENCE

II B. Sc., CS

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

 DAA – MCQ9

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

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

(A) 6                                                                     (B) 5

(C) 4                                                                     (D) 3

(03) 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

(04) 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

(05) A binary search tree is a binary tree:  

(A) All items in the left subtree are less than root

(B) All items in the right subtree are greater than or equal to the root

(C) Each subtree is itself a binary search tree

(D) All of the above

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

Answers for Nov 04, 2020 (DAA – MCQ8)

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