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
(91) The running time of Dijkastra’s algorithm is
(A) O(V2) (B) O(V+E) (C) O(n log n) (D) all of the above
(92) kruskal’s algorithm uses-------- and prim’s algorithm uses------ in determining the MST
(A) edges,vertex (B)vertex,edges (C)edges,edges (D)vertex,vertex
(93) The running time of kruskal’s algorithm for MST
(A) O(E) (B) O(V) (C) O(E log V) (D) all of the above
(94) We can perform a topological sort in time -----------, since DFS takes ------ time.
(A) ϴ (V+E), ϴ (E) (B) ϴ (E), ϴ (V+E)
(C) ϴ (V+E), ϴ (V+E) (D) all of the above
(95) The running time of BFS is------------
(A) ϴ (1) (B) ϴ (n log n) (C) O(V+E) (D) ϴ (n2)
(96) For------ insertion sort beats merge sort
(A) n≥43 (B) n≤23 (C) n≤43 (D) cannot say
(97) Best case running time of quick sort is
(A) O(n) (B) O(logn) (C) O(nlogn ) (D) O(n2)
(98) A characteristic of the data that binary search tree but the linear search ignores, is the
(A) Order of the list (B) length of the list
(C) maximum value in the list (D) mean of data values
(99) A sort which compares adjacent elements in a list and switches where necessary is a
(A) insertion sort (B) heap sort
(C) quick sort (D) bubble sort
(100) A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called
(A) Insertion sort (B) selection sort
(C) Heap sort (D) quick sort
(101) A sort which uses the binary tree concept such that any number is larger than all the numbers is the subtree below it is called
(A) Selection sort (B) insertion sort (C) quick sort (D) heap sort
(102) which of the sorting algorithm does not have a worst case running time of O(n2)
(A) Selection sort (B) insertion sort (C) merge sort (D) quick sort
(103) which of the following sorting method is stable?
(A) Straight insertion sort (B) binary search tree
(C) Shell sort (D) Heap sort
(104) A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as
(A) Binary search tree (B) AVL tree
(C) Completely balanced tree (D) Heap
(105) The recurrence relation T(n) = mT(n/2)+ an2 is satisfied by
(A) T (n) = O(nm) (B) T(n) = O(n log m) (C) T(n) = O( n log n) (D) T(n) =O(m log n)
(106)The time required to find shortest path in a graph with n vertices and e edges is
(A) O (e) (B) O (n) (C) O (e2) (D) O (n2)
(107)The goal of hashing is to produce a search tree that takes
(A) O(1) time (B) O(n2) time (C) O (log n) time (D) O (n log n) time
(108) which of the following best described sorting?
(A) Accessing and processing each record exactly once
(B) Finding the location of the record with a given key
(C) Arranging the data in some given order
(D) Adding a new record to the data structure
(109) The worst case complexity of straight insertion sort algorithm to sort n elements is
(A) O(n) (B) O(n log n) (C) O(n1.2) (D) O(n2)
(110) The worst case complexity of binary insertion sort algorithm to sort in n elements is
(A) O(n) (B) O(n log n) (C) O(n1.2) (D) O(n2)
Algorithms Design And Analysis MCQS with Answers
| 91 | A |
| 92 | A |
| 93 | C |
| 94 | C |
| 95 | C |
| 96 | C |
| 97 | C |
| 98 | A |
| 99 | D |
| 100 | B |
| 101 | C |
| 102 | C |
| 103 | A |
| 104 | D |
| 105 | |
| 106 | D |
| 107 | A |
| 108 | C |
| 109 | D |
| 110 | D |
