Skip to content
Official PYQ · 2017

GATE EC 2017 Set 2 Q44 — Combinatorial Circuits

Explain with AI

Figure Ⅰ shows a 44-bit ripple carry adder realized using full adders and Figure Ⅱ shows the circuit of a full-adder (FA). The propagation delay of the XOR, AND and OR gates in Figure Ⅱ are 2020 ns, 1515 ns and 1010 ns, respectively. Assume all the inputs to the 44-bit adder are initially reset to 00.

 

Figure I

         

Figure II

At t=0t = 0, the inputs to the 44-bit adder are changed to X3X2X1X0=1100X_3X_2X_1X_0=1100, Y3Y2Y1Y0=0100Y_3Y_2Y_1Y_0=0100 and Z0=1Z_0=1. The output of the ripple carry adder will be stable at tt (in ns) = ___________

View answer

Answer: 50.0:50.0

Worked explanation not available yet.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Combinatorial Circuits questions