GATE CS 2017 Set 2 — Question 42

MCQ+2 / -0.67MediumCounters (Sync, Async)Sequential CircuitsDigital LogicFlip-Flops (JK, T, D)

Digital Logic → Sequential Circuits → Counters (Sync, Async)

Last updated 5 September 2026

Question

Q_1

$Q_1$	$Q_0$	$Q_1^+$	$Q_0^+$
0	0	0	1
0	1	1	0
1	0	1	1
1	1	1	1

T_1

Review answer and solution without JavaScript

Interactive answer checking needs JavaScript. The published solution is available below.

T_1

$Q_1$	$Q_0$	$Q_1^+$	$Q_0^+$	$T_1 = Q_1 \oplus Q_1^+$	$T_0 = Q_0 \oplus Q_0^+$
0	0	0	1	0	1
0	1	1	0	1	1
1	0	1	1	0	1
1	1	1	1	0	0

Continue learning with Success Tracker

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.