V

Vijay Sangwan • 28.62K Points
Instructor II 

Q. What is the running time of the Huffman algorithm, if its implementation of the priority queue is done using linked lists?

(A) o(c)
(B) o(log c)
(C) o(c log c)
(D) o(c2)
Correct : Option (D)

Explanation: 
 if the implementation of the priority queue is done using linked lists, the running time of huffman algorithm is o(c2).

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which of the following is a type of abstraction?

Q. Based on survey , it was found that the probability that person like to watch serials is 0.25 and the probability that person like to watch netflix se

Q. The file permission 764 means

Q. Failure occurrences can be represented as

Q. There is an addition of round key before the start of the AES round algorithms.

Q. Pretty good privacy (PGP) security system uses

Q. To demonstrate that someone is lying about an alibi, it is necessary to:

Q. Following issue(s) is/are the true about sorting techniques with parallel computing.

Q. How many types of the data type are there in the ring counter?

Q. DHCP uses UDP port ____ for sending data to the server.