retagged by
2,894 views
3 votes
3 votes

Following Multiplexer circuit is equivalent to

  1. Sum equation of full adder
  2. Carry equation of full adder
  3. Borrow equation for full subtractor
  4. Difference equation of a full subtractor
retagged by

2 Answers

5 votes
5 votes

$Y= A'B'C + A'BC' + AB'C' + ABC$

$Y= A\  xor \ B \ xor   \ C$

$Y= \sum(1,2,4,6,7)$, difference equation of full subtractor.

Hence Option d) is correct

2 votes
2 votes
The output Y of the given MUX is the equation for the difference of a full subtractor and Sum of a Full Adder.
Y is the difference between A and B where C is the Barrow.
Y is the Sum of A and B where C is the Carry_in.

Y = B’A’C + B’AC’ + BA’C’ + BAC
Y = (A ⊕ B ⊕ C)
Answer:

Related questions

3.4k
views
3 answers
8 votes
Satbir asked Jan 13, 2020
3,369 views
If $ABCD$ is a $4$-bit binary number, then what is the code generated by the following circuit?BCD codeGray code$8421$ codeExcess-$3$ code
5.8k
views
2 answers
6 votes
Satbir asked Jan 13, 2020
5,810 views
Minimum number of NAND gates required to implement the following binary equation$Y = (\overline{A}+\overline{B})(C+D)$4$5$3$6$
3.1k
views
3 answers
4 votes
Satbir asked Jan 13, 2020
3,050 views
Consider the following circuitThe function by the network above is$\overline{AB}E+EF+\overline{CD}F$ ... (C+D+\overline{F})$(A+B)\overline{E} +\overline{EF}+CD\overline{F}$
3.6k
views
2 answers
6 votes
Satbir asked Jan 13, 2020
3,580 views
In a $8$-bit ripple carry adder using identical full adders, each full adder takes $34$ ns for computing sum. If the time taken for $8$-bit addition is $90$ ns, find time taken by each full adder to find carry.$6$ ns$7$ ns$10$ ns$8$ ns