Register

ISRO2020-10

• retagged by
2,755 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
User Avatar

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

User Avatar
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)
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

8 votes
8 votes
3 answers
1
Satbir asked Jan 13, 2020
3,161 views
ISRO2020-12
If $ABCD$ is a $4$-bit binary number, then what is the code generated by the following circuit? BCD code Gray code $8421$ code Excess-$3$ code
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
User Avatar
6 votes
6 votes
2 answers
2
Satbir asked Jan 13, 2020
5,447 views
ISRO2020-11
Minimum number of NAND gates required to implement the following binary equation $Y = (\overline{A}+\overline{B})(C+D)$ $4$ $5$ $3$ $6$
Minimum number of NAND gates required to implement the following binary equation$Y = (\overline{A}+\overline{B})(C+D)$$4$$5$$3$$6$
User Avatar
4 votes
4 votes
3 answers
3
Satbir asked Jan 13, 2020
2,883 views
ISRO2020-77
Consider the following circuit The 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)(\overline{E}+\overline{F})(C+D+\overline{F})$ $(A+B)\overline{E} +\overline{EF}+CD\overline{F}$
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...
User Avatar
6 votes
6 votes
2 answers
4
Satbir asked Jan 13, 2020
3,437 views
ISRO2020-9
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
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...
User Avatar
Link Copied!