(A) 80
(B) 100
(C) 160
(D) 320
Tag: Fundamentals of Computer Algorithms
The Huffman codes provide a method of encoding data inefficiently when coded using ASCII standard?
(A) True
(B) False
(C) NA
(D) NA
Non-optimal or greedy algorithm for money change takes__.
(A) O(k)
(B) O(kN)
(C) O(2k)
(D) O(N)
Merge sort requires extra array storage?
(A) True
(B) False
(C) NA
(D) NA
A p × q matrix A can be multiplied with a q × r matrix B. The result will be a p × r matrix C. There are (p . R) total entries in C and each takes __ to compute.
(A) O (q) (p= 84)
(B) O (1)
(C) O (n^2)
(D) O (n^3)
The difference between Prim’s algorithm and Dijkstra’s algorithm is that Dijkstra’s algorithm uses a different key?
(A) True
(B) False
(C) NA
(D) NA
Dijkstra’s algorithm is operates by maintaining a subset of vertices?
(A) True
(B) False
(C) NA
(D) NA
In the clique cover problem, for two vertices to be in the same group, they must be adjacent to each other?
(A) True
(B) False
(C) NA
(D) NA