McqMate

Q. |
## What is the running time of the Huffman encoding algorithm? |

A. | o(c) |

B. | o(log c) |

C. | o(c log c) |

D. | o( n log c) |

Answer» C. o(c log c) | |

Explanation: if we maintain the trees in a priority queue, ordered by weight, then the running time is given by o(c log c). |

974

0

Do you find this helpful?

1

View all MCQs in

Communication EngineeringNo comments yet

- What is the running time of the Huffman algorithm, if its implementation of the priority queue is done using linked lists?
- Which of the following algorithms is the best approach for solving Huffman codes?
- Which of the following is not an advantage of Fano’s algorithm in comparison to Viterbi’s algorithm?
- In comparison to stack algorithm, Fano’s algorithm is simpler.
- Which method is called as differential encoding?
- The signals which are obtained by encoding each quantized signal into a digital word is called as
- The length of the code-word obtained by encoding quantized sample is equal to
- In PCM encoding, quantization level varies as a function of
- Source encoding procedure does
- How many bits are needed for standard encoding if the size of the character set is X?