Register

Digital logic question

619 views
0 votes
0 votes
A 1-bit full adder takes 20ns to generate carry out bit and 40ns to the sum bit. When four 1-bit full adders are cascaded , then the total  time for additions is
User Avatar

Please log in or register to answer this question.

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

Related questions

0 votes
0 votes
0 answers
1
deba1014 asked Apr 12
58 views
Digital Logic
What is the maximum n-bit number in base x ,when represented in decimal(10)?
What is the maximum n-bit number in base x ,when represented in decimal(10)?
User Avatar
0 votes
0 votes
2 answers
3
rajveer43 asked Jan 12
202 views
Digital Logic | Sample question
The number of full and half-adders required to add $32$-bit numbers is______________________
The number of full and half-adders required to add $32$-bit numbers is______________________
User Avatar
0 votes
0 votes
0 answers
4
Redcom1988 asked Dec 23, 2023
196 views
A variation on Digital Logic: Morris Mano Edition 3 Exercise 7 Question 4 (Page No. 303)
Design a counter according to the state diagram above using only NAND gates and JK Flip-flops (if needed) complete with state tables
Design a counter according to the state diagram above using only NAND gates and JK Flip-flops (if needed) complete with state tables
User Avatar
Link Copied!