- Computer Science Engineering (CSE)
- Communication Engineering
- What is the running time of the Huffman ...

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) |

Answer» D. o(c2) | |

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

View all MCQs in:
Communication Engineering

- What is the running time of the Huffman encoding algorithm?
- 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.
- Fano’s algorithm searches all the paths of trellis diagram at same time to find the most probable path.
- Equalization method which is done by tracking a slowly time varying channel response is
- Lempel-Ziv algorithm is
- Which of the following is not an algorithm for decoding convolution codes?
- Which decoding method involves the evaluation by means of Fano’s algorithm?
- In Viterbi’s algorithm, the selected paths are regarded as

Login to Continue

It will take less than 2 minutes

Report MCQ