Login
Register
THE GATEBOOK Q&A
THE GATEBOOK
Questions
Unanswered
Tags
Categories
Users
Exams Taken
Exam List
Normalization Lectures
All categories
Discrete Maths
(91)
DSA and C Programming
(106)
DBMS
(64)
Digital
(111)
Compilers
(55)
Computer Networks
(61)
Operating Systems
(55)
TOC
(76)
Aptitude
(20)
Computer Organization
(90)
Basic Maths
(76)
Digital-GrandTest1-Q9
+4
votes
<p>Assuming usual gate design implementation of a Full Adder module, the propagation delay of an XOR gate is three times as that of an AND/OR gate. A 4-bit binary adder is to be made by using 4 such modules. The minimum propagation time of the entire 4-bit adder if the individual delay of an AND/OR gate being 2.4 microseconds is assuming no delay between modules?</p>
numerical-answers
asked
Jun 19
in
Digital
by
gbmentor
(
83,420
points)
3
flags
reshown
Jun 20
by
gbmentor
Please
log in
or
register
to answer this question.
3 Answers
–1
vote
Not sure I think 35 m sec
answered
Jun 20
by
tsnikhilsharmagate2018
(
30,120
points)
Please
log in
or
register
to add a comment.
0
votes
Answer will be 24 microseconds.
answered
Jun 20
by
tsjeganbalajibs
(
390
points)
What is the right answer of this question 24 or 26.4? If it is 26.4 plz explain me how this answer come.
It is clearly mentioned in the question that all modules uses full adders, so 28.8micro seconds must be the answer.
Yes, it should be 28.8 if FA modules, or 24 if one HA, but 26.4 is not possible as minimum.
Please
log in
or
register
to add a comment.
–1
vote
can anyone explain how are we getting 26.4?
answered
Jun 21
by
tsabhineetsingh192
(
4,250
points)
Please
log in
or
register
to add a comment.
Answer:
26.4
...