- Computer Science Engineering (CSE)
- Communication Engineering
- Fano’s algorithm searches all the paths ...

Q. |
## Fano’s algorithm searches all the paths of trellis diagram at same time to find the most probable path. |

A. | true |

B. | false |

Answer» B. false | |

Explanation: fano’s algorithm searches for the most probable path through the trellis diagram by examining one path at a time. the error rate performance of fano’s algorithm is comparable to viterbi’s algorithm. |

View all MCQs in:
Communication Engineering

- In Viterbi’s algorithm, the selected paths are regarded as
- 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?
- 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?
- The antenna current is 10A. Find the percentage of modulation when the antenna current increases to 10.4A?
- Find the total power, if the carrier of an AM transmitter is 800W and it is modulated to 50%?

Login to Continue

It will take less than 2 minutes

Report MCQ