retagged by
5,077 views
4 4 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

2 Answers

6 6 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 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:
Position:
Show:

Related questions

11 11 votes
3 3 answers
5.7k
5.7k views
Satbir asked Jan 13, 2020
5,680 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
15 15 votes
3 3 answers
11.5k
11.5k views
Satbir asked Jan 13, 2020
11,499 views
Minimum number of NAND gates required to implement the following binary equation$Y = (\overline{A}+\overline{B})(C+D)$$4$$5$$3$$6$
4 4 votes
3 3 answers
5.7k
5.7k views
Satbir asked Jan 13, 2020
5,687 views
Consider the following circuitThe function by the network above is$\overline{AB}E+EF+\overline{CD}F$$(\overline{E}+AB\overline{F})(C+D+\overline{F})$$(\overline{AB}+E)(\o...
10 10 votes
2 2 answers
6.7k
6.7k views
Satbir asked Jan 13, 2020
6,669 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...