MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 15 Mcqs, each offering curated multiple-choice questions to sharpen your Wireless Mobile Communications knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
In Viterbi’s algorithm, the selected paths are regarded as __________ |
| A. | Survivors |
| B. | Defenders |
| C. | Destroyers |
| D. | Carriers |
| Answer» B. Defenders | |
| 2. |
Which decoding method involves the evaluation by means of Fano’s algorithm? |
| A. | Maximum Likelihood Decoding |
| B. | Sequential Decoding |
| C. | Maximum a priori |
| D. | Minimum mean square |
| Answer» C. Maximum a priori | |
| 3. |
In comparison to stack algorithm, Fano’s algorithm is simpler. |
| A. | True |
| B. | False |
| Answer» C. | |
| 4. |
Which of the following is not an advantage of Fano’s algorithm in comparison to Viterbi’s algorithm? |
| A. | Less storage |
| B. | Large constraint length |
| C. | Error rate |
| D. | Small delays |
| Answer» E. | |
| 5. |
Fano’s algorithm searches all the paths of trellis diagram at same time to find the most probable path. |
| A. | True |
| B. | False |
| Answer» C. | |
| 6. |
Viterbi algorithm performs ____________ decoding of convolutional codes. |
| A. | Maximum likelihood |
| B. | Maximum a posteriori |
| C. | Minimum square |
| D. | Minimum mean square |
| Answer» B. Maximum a posteriori | |
| 7. |
WHICH_OF_THE_FOLLOWING_IS_NOT_AN_ERROR_CORRECTION_AND_DETECTION_CODE??$ |
| A. | Block code |
| B. | Convolutional codes |
| C. | Passive codes |
| D. | Turbo codes |
| Answer» D. Turbo codes | |
| 8. |
In Viterbi’s algorithm, the selected paths are regarded as __________$# |
| A. | Survivors |
| B. | Defenders |
| C. | Destroyers |
| D. | Carriers |
| Answer» B. Defenders | |
| 9. |
Which_decoding_method_involves_the_evaluation_by_means_of_Fano’s_algorithm?$# |
| A. | Maximum Likelihood Decoding |
| B. | Sequential Decoding |
| C. | Maximum a priori |
| D. | Minimum mean square |
| Answer» C. Maximum a priori | |
| 10. |
In comparison to stack algorithm, Fano’s algorithm is simpler?# |
| A. | True |
| B. | False |
| Answer» C. | |
| 11. |
Which of the following is not an advantage of Fano’s algorithm in comparison to Viterbi’s algorithm?$ |
| A. | Less storage |
| B. | Large constraint length |
| C. | Error rate |
| D. | Small delays |
| Answer» E. | |
| 12. |
Viterbi algorithm performs ______ decoding of convolutional codes. |
| A. | Maximum likelihood |
| B. | Maximum a posteriori |
| C. | Minimum square |
| D. | Minimum mean square |
| Answer» B. Maximum a posteriori | |
| 13. |
Which of the following is not an algorithm for decoding convolution codes? |
| A. | Viterbi algorithm |
| B. | Stack algorithm |
| C. | Fano’s sequential coding |
| D. | Ant colony optimization |
| Answer» E. | |
| 14. |
Which of the following indicates the number of input bits that the current output is dependent upon? |
| A. | Constraint length |
| B. | Code length |
| C. | Search window |
| D. | Information rate |
| Answer» B. Code length | |
| 15. |
Block codes can achieve a larger coding gain than convolution coding. |
| A. | True |
| B. | False |
| Answer» C. | |