- Computer Science Engineering (CSE)
- Communication Engineering
- Lempel-Ziv algorithm is

Q. |
## Lempel-Ziv algorithm is |

A. | variable to fixed length algorithm |

B. | fixed to variable length algorithm |

C. | fixed to fixed length algorithm |

D. | variable to variable length algorithm |

Answer» A. variable to fixed length algorithm | |

Explanation: lempel-ziv algorithm is a variable to fixed length algorithm. |

View all MCQs in:
Communication Engineering

- 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.
- What is the running time of the Huffman encoding algorithm?
- 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 is not an algorithm for decoding convolution codes?
- Fano’s algorithm searches all the paths of trellis diagram at same time to find the most probable path.
- 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