Bellman-Ford allows negative weights edges and negative cost cycles?
a) True
b) False
c) NA
d) N/A
Dijkstra’s single source shortest path algorithm works if all edges weights are non-negative and there are negative cost cycles?
a) True
b) False
c) NA
d) N/A
Shortest path problems can be solved efficiently by modeling the road map as a graph?
a) True
b) False
c) NA
d) N/A
The Huffman algorithm finds a polynomial solution?
a) True
b) False
c) NA
d) N/A
The Huffman algorithm finds an exponential solution?
a) True
b) False
c) NA
d) N/A
The Huffman algorithm finds a (n).......solution.
a) Optimal
b) Non-optima
c) Exponential
d) Polynomial
