Algorithms Design And Analysis MCQS with Answers Set 4

Algorithms Design And Analysis MCQS with Answers

Algorithms Design And Analysis MCQS with Answers is mainly intended fro GATE aspirants.These questions can also came in Btech Computer science university exams and various interview for computer science students

(46) If Total complexity after micro analysis is 5n3 + 10n2 + 100 n +400 logn+ 10,  
The Big Oh complexity is
(A)   O(n2)    (B) O(n3)          (C) O(nlogn)    (D) O(n2logn)

(47) In Strassen’s Multiplication Algorithm the T(n)  is
A) 7T (n) + bn2              B) 7T (n/2) + bn2       C) 8T (n/2) + bn2               D) 7T (n/2) + bn 

(48) T (n) = 4 T (n/2) + n   then in Big Oh Notation it is
A)  O (n2)                    B) O(4)                       (C)  O(n)                      D) O(log(n))

(49) In T(n) = a * T(n/b) + f(n)  ,  a refers to
     (A)  Size of sub problem     (B) No. of sub problems
    (C) Size of the problem       (D) Time to combine solutions  

(50) 0-1 knapsack be solved using
(A)   dynamic programming                       (B)  Backtracking        (C) Branch & Bound   
(D) All A,B,C,E                               (E) Genetic Programming

(51) In depth first search algorithm the no. of recursive calls we have to make are
      (A) 2             (B) 1             (C)   6            (D) depends on the graph

(52) O (f(n))  minus O(f(n))  is equal to
(A)  Zero                 (B) A constant             (C) f(n)             (D) O(f(n))



(53) Quick sort is solved using
    (A) Divide and conquer                   (B) Greedy Programming 
    (C) Dynamic Programming                         (D) Branch and bound

(54) For i = 1 to n-1 do
2.1 For j = 1 to n-1-i do
2.2.1 If (a[j+1] < a[j]) then swap a[j] and a[j+1]
Given code is for
(A)  Bubble sort        (B) Insertion sort               (C) Quick Sort                    (D) Selection Sort

(55) Worst case complexity of quick sort is
   (A)  O(n)                               (B) O(logn)                         (C) O(nlogn )                            (D) O(n2)

(56) The sub problems in Divide and Conquer are considered to be
A) Distinct         (B) overlapping                        (C) large size                      (D) small size
(57) Which of the following name does not relate to stacks?
(A)  FIFO lists               (B) LIFO list                 (C) Piles                                   (D) Push-down lists

(58) Which of the following data structure is linear type?
(A) Strings       (B) Lists                       (C) Queues      D) All of above
(59) In a graph if e=(u, v) means
(A)  u is adjacent to v but v is not adjacent to u                     (B) e begins at u and ends at v
(C)  u is processor and v is successor                         (D) both b and c
(60) An algorithm that calls itself directly or indirectly is known as

(A) Sub algorithm        (B) Recursion  (C) Polish notation      (D) Traversal algorithm

Algorithms Design And Analysis MCQS with Answers

46 B
47 B
48 A
49 B
50 D
51 D
52 D
53 A
54 A
55 D
56 D
57 A
58 D
59 D
60 B

This entry was posted on Friday, 5 September 2014 and is filed under ,. You can follow any responses to this entry through the RSS 2.0. You can leave a response.

One Response to “Algorithms Design And Analysis MCQS with Answers Set 4”