Register

Made Easy Test Series Mock Test

295 views

1 Answer

0 votes
0 votes

You might have missed that M is also the input carry C$_{0}$

A = 1 1 0 0 

B = 1 0 0 0 

M = 1 gives bit-wise XOR of 1 with B

i.e

B = 0 1 1 1

Now to Add

C   1 1 1

A   1 1 0 0

B   0 1 1 1

C            1

   1  0 1 0 0

C$_{4}$S$_{3}$S$_{2}$S$_{1}$S$_{0}$

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

841
views
2 answers
5 votes
GO Classes asked Jan 21
841 views
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 53
Consider the following $4$-bit adder circuit.Note, $\text{C}_0$ is carry in and $\text{C}_4$ is carry out for the $4$ ... $\text{S}=1$
User Avatar
637
views
1 answers
3 votes
Bikram asked Feb 9, 2017
637 views
Test by Bikram | Mock GATE | Test 3 | Question: 24
A $4-bit$ carry-lookahead adder adds two $4-bit$ numbers. The adder is designed only using $AND, OR, NOT, NAND $ and $NOR$ gates. We assume that ... logic.Thus, the overall propagation delay of the adder is ______ in terms of time units.
User Avatar
376
views
0 answers
1 votes
nikkey123 asked Sep 16, 2017
376 views
made easy book
If the carry propogation delay is 5 in full adder then multiplication of 8 bit number using co-multiplier takes(Assume AND gate delay=2)
User Avatar
1.5k
views
3 answers
0 votes
shivangi5 asked Dec 4, 2017
1,450 views
MadeEasy Test Series: Digital Logic - Adder
A 1-bit full adder circuit takes 5 ns to generate the carry-out bit and 10 ns for the sum-bit. When 4, 1-bit full adders are cascaded, the maximum rate of additions per second will be _______ × 107.
User Avatar
Link Copied!