GATE EC 2017 Set 2 — Question 44

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
NAT+2 / -0HardAdders & SubtractorsCombinational LogicDigital Circuits

Digital Circuits → Combinational Logic → Adders & Subtractors

Last updated

Question

Figure I shows a 4-bit ripple carry adder realized using full adders and Figure II shows the circuit of a full-adder (FA). The propagation delay of the XOR, AND and OR gates in Figure II are 20 ns, 15 ns and 10 ns, respectively. Assume all the inputs to the 4-bit adder are initially reset to 0.
Figure I - 4-bit ripple carry adder
Figure II - Full adder circuit
At t=0t = 0, the inputs to the 4-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) = ________.
Your answer

Enter a number. Decimals, negative values and scientific notation are accepted.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE EC question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Combinational Logic