(A) True
(B) False
(C) NA
(D) NA
Tag: Fundamentals of Computer Algorithms
Bellman-Ford allows negative weights edges and negative cost cycles?
(A) True
(B) False
(C) NA
(D) NA
Dijkestra’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) NA
Shortest path problems can be solved efficiently by modeling the road map as a graph?
(A) True
(B) False
(C) NA
(D) NA
The Huffman algorithm finds a polynomial solution?
(A) True
(B) False
(C) NA
(D) NA
The Huffman algorithm finds an exponential solution?
(A) True
(B) False
(C) NA
(D) NA
The Huffman algorithm finds a (n) __ solution.
(A) Optimal
(B) Non-optima
(C) Exponential
(D) Polynomial
Maximum number of vertices in a Directed Graph may be |V2|?
(A) True
(B) False
(C) NA
(D) NA