A

Admin • 36.93K Points
Coach 

Q. Which of the following algorithms is the best approach for solving Huffman codes?

(A) exhaustive search
(B) greedy algorithm
(C) brute force algorithm
(D) divide and conquer algorithm
Correct : Option (B)

Explanation: 
 greedy algorithm is the best approach for solving the huffman codes problem since it greedily searches for an optimal solution.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. The_______algorithm is based on the observation that the frequent sets are normally very few in number compared to the set of all itemsets

Q. Independent variables is characteristic changed to produce different condition. Choose the example of Independent variables i. Gender ii. Interface st

Q. The main advantage of multiple bus organisation over a single bus is

Q. the procedure is disturbed and require only point-to-point _______

Q. Markov process called

Q. .... is the layer of a computer system between the hardware and the user program

Q. A namespace can contain___________.

Q. The outcome of Dijkstra’s calculation is used to populate the __________

Q. 3: Flip-flop outputs are always

Q. Mental model is a/ an _ of a device or a system