- Computer Science Engineering (CSE)
- Digital Electronics and Logic Design
- A 2 bit binary multiplier can be impleme...

Q. |
## A 2 bit binary multiplier can be implemented using |

A. | 2 input ands only |

B. | 2 input xors and 4 input and gates only |

C. | 2 input nors and one xnor gate |

D. | nor gates and shift registers |

Answer» B. 2 input xors and 4 input and gates only |

View all MCQs in:
Digital Electronics and Logic Design

- 4: How many gates (minimum) are needed for a 3-bit up-counter using standard binary and using T lip-lops ? Assume unlimited fan-in.
- An 8-bit binary number is input to an odd parity generator. The parity bit will equal 1 only if .
- Assume that a 4-bit serial in/serial out shift register is initially clear. We wish to store the nibble 1100. What will be the 4-bit pattern after the second clock pulse? (Right-most bit first.)
- One reason for using the sum-of-products form is that it can be implemented using all gates without much difficulty.
- The Unsigned Binary representation can only represent positive binary numbers
- The sequence of states that are implemented by a n-bit Johnson counter is
- The sequence of states that are implemented by a n-bit Johnson counter is
- How many 1-of-16 decoders are required for decoding a 7-bit binary number?
- How many 4-bit parallel adders would be required to add two binary numbers each representing decimal numbers up through 30010?
- What is the maximum counting speed of a 4-bit binary counter which is composed of flip-flops with a propagation delay of 25 ns ?

Login to Continue

It will take less than 2 minutes

Report MCQ