SRI LAKSHMI COLLEGE OF ARTS &
SCIENCE
DEPARTMENT OF COMPUTER SCIENCE
II B. Sc., CS
DESIGN & ANALYSIS OF ALGORITHMS (BSCS33) – MCQs – 27/10/2020
(01) The number of spanning trees possible for the following Graph G is
(A) 1 (B) 3
(C) 12 (D) 27
(02) Which of the following is/are true about spanning tree?
1. The spanning tree does not have any cycle (loops).
2. A connected graph G can have more than one spanning tree.
(A) 1 only (B) 2 only
(C) Both 1 and 2 (D) Neither 1 nor 2
(03) Which of the following is/are correct?
1. Dynamic Programming (Approach) uses Top - down approach method
2. Greedy Programming (Approach) uses Bottom - up approach method
(A) 1 only (B) 2 only
(C) Both 1 and 2 (D) Netiher1 nor 2
(04) Number of Asymptotic notations
(A) 2 (B) 3
(C) 4 (D) 5
(05) The asymptotic notation which denotes the upper bound
(A) Big – Omega (B) Big – Theta
(C) Big – Oh (D) Big – Ki
(06) f (n)≥c*g(n) denotes
(A) Big – Omega (B) Big – Theta
(C) Big – Oh (D) Big – Ki
(07) Which of the following is correct?
(A) Asymptotic Notation helps us to make accurate and meaningful assumptions about time complexity and space complexity
(B) Asymptotic Notation helps us to make accurate and meaningful assumptions about time complexity only
(C) Asymptotic Notation helps us to make approximate and meaningful assumptions about time complexity and space complexity
(D) Asymptotic Notation helps us to make approximate and meaningful assumptions about time complexity only
(08) Which of the following cases is not there in determining the complexity of the algorithm?
(A) Null case (B) Best case
(C) Average case (D) Worst case
(09) In Space Complexity, space can be classified into ___ types
(A) 2 (B) 3
(C) 4 (D) 5
(10) In pseudocode ß denotes
(A) Comments (B) Condition
(C) Assignment (D) Looping
No comments:
Post a Comment