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)
Share
Explanation by: Vijay Sangwan
if the implementation of the priority queue is done using linked lists, the running time of huffman algorithm is o(c2).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. One computer that is not considered a portable is

Q. In web mining, is used to find natural groupings of users, pages, etc.

Q. Full path name starts with …..

Q. A search key containing more than one attribute is referred to as a search key.

Q. What incorporates data, architectural, interface, and procedural representations of the software?

Q. Which one of the following is not a secondary storage?

Q. What is Critical Path?

Q. Which of the following is true about packages?

Q. ICMP stands for

Q. In the client / server model, the database:

Question analytics