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
(61) In a Heap tree
(A) Values in a node is greater than every value in left sub tree and smaller than right sub tree
(B) Values in a node is greater than every value in children of it
(C) Both of above conditions applies (D) none of above conditions applies
(62) The postfix form of the expression (A+ B)*(C*D− E)*F / G is
(A) AB+ CD*E − FG /** (B) AB + CD* E − F **G /
(C) AB + CD* E − *F *G / (D) AB + CDE * − * F *G /
(63) What is the postfix form of the following prefix expression -A/B*C$DE
(A) ABCDE$*/- (B) A-BCDE$*/-
(C) ABC$ED*/- (D) A-BCDE$*/
(64) You have to sort a list L consisting of a sorted list followed by a few “random” elements.
Which of the following sorting methods would be especially suitable for such a task?
(A) Bubble sort (B) Selection sort
(C) Quick sort (D) Insertion sort
(65) A technique for direct search is
(A) Binary Search (B) Linear Search
(C) Tree Search (D) Hashing
(66) The searching technique that takes O (1) time to find a data is
(A) Linear Search (B) Binary Search (C) Hashing (D) Tree Search
(67) A mathematical-model with a collection of operations defined on that model is called
(A) Data Structure (B) Abstract Data Type
(C) Primitive Data Type (D) Algorithm
(68) The complexity of multiplying two matrices of order m*n and n*p is
(A) mnp (B) mp (C) mn (D) np
(69) In worst case Quick Sort has order
(A) O (n log n) (B) O (n2/2) (C) O (log n) (D) O (n2/4)
(70) A full binary tree with n leaves contains
(A) n nodes. (B) log 2 n nodes. (C) 2n –1 nodes. (D) n 2 nodes.
(71) The quick sort algorithm exploit _________ design technique
(A) Greedy (B) Dynamic programming (C)Divide and Conquer (D) Backtracking
(72) The maximum degree of any vertex in a simple graph with n vertices is
(A) n–1 (B) n+1 (C) 2n–1 (D) n
(73) The total number of companions required to merge 4 sorted files containing 15, 3, 9 and 8 records into a single sorted file is
(A) 66 (B) 39 (C) 15 (D) 33
(74) The number of leaf nodes in a complete binary tree of depth d is
(A) 2d (B) 2d-1 +1 (C) 2d+1 +1 (D)2d +1
(75) If x is initialize as x=100. What will be the value of x and y after step-4?
Step 1 x=100;
Step 2 Y=x++;
Step 3 x=x+y ;
Step 4 Y=++x;
(a)302,201 (b) 201,302 (c)101 ,100 (d)None of these
Algorithms Design And Analysis MCQS with Answers
| 61 | B |
| 62 | A |
| 63 | A |
| 64 | D |
| 65 | D |
| 66 | C |
| 67 | B |
| 68 | A |
| 69 | B |
| 70 | C |
| 71 | C |
| 72 | A |
| 73 | D |
| 74 | A |
| 75 | D |
