|
CS502
|
The Greedy Part Of The Huffman Encoding Algorithm Is To First Find Two Nodes With Smallest Frequency
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
The Codeword Assigned To Characters By The Huffman Algorithm Have The Property That No Codeword Is The Postfix Of Any Other
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Node Of A B- Tree Is Stored In Memory Block And Traversing A B-Tree Involves Page Faults?
|
O (N^2)
|
O (N)
|
O (N Log N)
|
O (Log N)
|
D
|
|
CS502
|
The Mathematical Tools Necessary For The Analysis Of Algorithms. This Will Focus On Asymptotics Summations Recurrences
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Sieve Technique Can Be Applied To Selection Problem?
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Floyd-Warshall Algorithm Is A Dynamic Programming Algorithm; The Genius Of The Algorithm Is In The Clever Recursive Formulation Of The Shortest Path Problem
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Dynamic Programming Algorithms Need To Store The Results Of Intermediate Subproblems
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
The Number Of Nodes In A Complete Binary Tree Of Height H Is
|
2^(H+1) – 1
|
2 * (H+1) – 1
|
2 * (H+1)
|
((H+1) ^ 2) – 1
|
A
|
|
CS502
|
Analysis Of Selection Algorithm Ends Up With
|
T(N)
|
T(1 / 1 + N)
|
T(N / 2)
|
T((N / 2) + N)
|
D
|