The term coloring came from the original application which was in map drawing?
a) True
b) False
c) NA
d) N/A
Floyd-Warshall algorithm is a dynamic programming algorithm; the genius of the algorithm is in the clever recursive formulation of the shortest path problem?
a) True
b) False
c) NA
d) N/A
Dijkstra’s s single source shortest path algorithm works if all edges weights are negative and there are no negative cost cycles?
a) True
b) False
c) NA
d) N/A
Depth first search is shortest path algorithm that works on un-weighted graphs?
a) True
b) False
c) N/A
d) N/A
Huffman algorithm uses a greedy approach to generate an antefix code T that minimizes the expected length B (T) of the encoded string?
a) True
b) False
c) NA
d) N/A
The greedy part of the Huffman encoding algorithm is to first find two nodes with character frequency?
a) True
b) False
c) NA
d) N/A
