**CS502 Quiz Fundamentals of Algorithms**

Question No: 1 ( Marks: 1 ) - Please choose one

If a problem is in NP-complete, it must also be in NP.

► True

► False

Question No: 2 ( Marks: 1 ) - Please choose one

The Huffman algorithm finds a optimal solution.

► True

► False

Question No: 3 ( Marks: 1 ) - Please choose one

The Huffman algorithm finds an exponential solution

► True

► False

Question No: 4 ( Marks: 1 ) - Please choose one

The Huffman algorithm finds a polynomial solution

► True

► False

Question No: 5 ( Marks: 1 ) - Please choose one

The greedy part of the Huffman encoding algorithm is to first find two nodes with smallest frequency.

► True

► False

Question No: 6 ( Marks: 1 ) - Please choose one

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 ( Marks: 1 ) - Please choose one

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 ( Marks: 1 ) - Please choose one

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 ( Marks: 1 ) - Please choose one

The term “coloring” came form the original application which was in architectural design.

► True

► False

Question No: 10 ( Marks: 1 ) - Please choose one

In the clique cover problem, for two vertices to be in the same group, they must be adjacent to each other.

► True

► False