GATE CS 2017 Set 1 — Question 9

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MCQ+1 / -0.33EasyBinary Arithmetic & OverflowNumber Systems & ArithmeticDigital LogicAdders & SubtractorsCombinational Circuits

Digital Logic → Combinational Circuits → Adders & Subtractors

Last updated

Question

When two 8-bit numbers A7A0A_7 \cdots A_0 and B7B0B_7 \cdots B_0 in 2's complement representation (with A0A_0 and B0B_0 as the least significant bits) are added using a ripple-carry adder, the sum bits obtained are S7S0S_7 \cdots S_0 and the carry bits are C7C0C_7 \cdots C_0 . An overflow is said to have occurred if
Your answer

Choose one option, then check your answer.

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 CS 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 Circuits