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.
(76) Struct x
{
int i;
char c;
}
union y{
struct x a;
double d;
};
printf("%d",sizeof(union y));
(A)8 (B)5 (C)4 (D)1
(77) Worst case complexity of the insertion sort algorithm is (A) O(n2) (B) O(n) (C) O(n-1) (D) O(n+1)
(78) Average case complexity of the insertion sort algorithm is
(A) O(n2) (B) O(n) (C) O(n-1) (D) O(n+1)
(79) Best case complexity of the insertion sort algorithm is
(A) O(n2) (B) O(n) (C) O(n-1) (D) O(n+1)
(80) Worst case complexity of the bubble sort algorithm is
(A) O(n3) (B) O(n4) (C) O(n2) (D) O(n)
(81) Best case complexity of the bubble sort algorithm is
(A) O(n3) (B) O(n4) (C) O(n2) (D) O(n)
(82) Average case complexity of the bubble sort algorithm is
(A) O(n3) (B) O(n4) (C) O(n2) (D) O(n)
(83) Worst case complexity of the selection sort algorithm is
(A) O(n3) (B) O(n4) (C) O(n2) (D) O(n)
(84) Average case complexity of the selection sort algorithm is
(A) O(n3) (B) O(n4) (C) O(n2) (D) O(n)
(85) Best case complexity of the selection sort algorithm is
(A) O(n3) (B) O(n4) (C) O(n2) (D) O(n)
(86) If a complete binary tree Tn has n=1000 nodes then its height is
(A) 21 (B) 10 (C) 11 (D) 12
(87) If a complete binary tree Tnhas n=1000000 nodes then its height is
(A) 21 (B) 20 (C) 23 (D) 22
(88) The running time of Strassen’s algorithm for matrix multiplication is
(A) ϴ (n) (B) ϴ (n3) (C) ϴ (n2) (D) ϴ (n2.81)
(89) The running time of Floyd-Warshall algorithm is
(A) ϴ (n) (B) ϴ (n3) (C) ϴ (n2) (D) ϴ (n log n)
(90) Dijkastra’s algorithm bears some similarity to
(A) BFS (B) prim’s algorithm (C) DFS (D) Both (A) & (C)
Algorithms Design And Analysis MCQS with Answers
| 76 | A |
| 77 | A |
| 78 | A |
| 79 | C |
| 80 | C |
| 81 | C |
| 82 | C |
| 83 | C |
| 84 | C |
| 85 | C |
| 86 | C |
| 87 | A |
| 88 | D |
| 89 | C |
| 90 | D |
