MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 13 Mcqs, each offering curated multiple-choice questions to sharpen your Vlsi knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which method is suitable for larger operands? |
| A. | Baugh-wooley algorithm |
| B. | Wallace trees |
| C. | Dadda multipliers |
| D. | Modified booth encoding |
| Answer» C. Dadda multipliers | |
| 2. |
What is the delay required to perform a single operation in a pipelined structure? |
| A. | 2n |
| B. | 3n |
| C. | 4n |
| D. | n |
| Answer» C. 4n | |
| 3. |
Which multiplier is very well suited for twos-complement numbers? |
| A. | Baugh-wooley algorithm |
| B. | Wallace trees |
| C. | Dadda multipliers |
| D. | Modified booth encoding |
| Answer» B. Wallace trees | |
| 4. |
WHICH_METHOD_IS_SUITABLE_FOR_LARGER_OPERANDS??$ |
| A. | baugh-wooley algorithm |
| B. | wallace trees |
| C. | dadda multipliers |
| D. | modified booth encoding |
| Answer» C. dadda multipliers | |
| 5. |
In which method minimum number of adder cells are used? |
| A. | baugh-wooley algorithm |
| B. | wallace trees |
| C. | dadda multipliers |
| D. | modified booth encoding |
| Answer» D. modified booth encoding | |
| 6. |
The completion time for multiplication time in baugh-wooley method is |
| A. | n |
| B. | 2n |
| C. | 3n |
| D. | 4n |
| Answer» C. 3n | |
| 7. |
Which method reduces number of cycles of operation? |
| A. | baugh-wooley algorithm |
| B. | wallace trees |
| C. | dadda multipliers |
| D. | modified booth encoding |
| Answer» E. | |
| 8. |
Latches choosen are |
| A. | static shift registers |
| B. | any flipflop |
| C. | dynamic shift register |
| D. | multiplexers |
| Answer» D. multiplexers | |
| 9. |
What is the delay required to perform a single operation in pipelined structure? |
| A. | 2n |
| B. | 3n |
| C. | 4n |
| D. | n |
| Answer» C. 4n | |
| 10. |
Which multiplier is very well suited for twos complement numebers? |
| A. | baugh-wooley algorithm |
| B. | wallace trees |
| C. | dadda multipliers |
| D. | modified booth encoding |
| Answer» B. wallace trees | |
| 11. |
Which method is easier to manipulate accumulator content? |
| A. | left shifting |
| B. | right shifting |
| C. | serial shifting |
| D. | parallel shifting |
| Answer» C. serial shifting | |
| 12. |
Which method uses reduced number of partial products? |
| A. | baugh-wooley algorithm |
| B. | wallace trees |
| C. | dadda multipliers |
| D. | modified booth encoding |
| Answer» E. | |
| 13. |
Multipliers are built using |
| A. | binary adders |
| B. | binary subtractors |
| C. | dividers |
| D. | multiplexers |
| Answer» B. binary subtractors | |