CS502 Quiz Fundamentals of Algorithms [2]

Question No: 1
If a problem is in NP-complete, it must also be in NP.
► True
► False

Question No: 2
The Huffman algorithm finds a optimal solution.

► True

► False

Question No: 3
The Huffman algorithm finds an exponential solution
► True
► False

Question No: 4
The Huffman algorithm finds a polynomial solution
► True
► False

Question No: 5
The greedy part of the Huffman encoding algorithm is to first find two nodes with smallest frequency.
► True
► False

Question No: 6
The codeword assigned to characters by the Huffman algorithm have the property that no codeword is the prefix of any other.
► True
► False

Question No: 7
Huffman algorithm uses a greedy approach to generate a postfix code T that minimizes the expected length B (T) of the encoded string.
► True
► False

Question No: 8
Dijkestra’s single source shortest path algorithm works if all edges weights are non-negative and there are negative cost cycles.
► True
► False

Question No: 9
The term “coloring” came form the original application which was in architectural design.
► True
► False

Question No: 10
In the clique cover problem, for two vertices to be in the same group, they must be adjacent to each other.
► True
► False