GATE Digital Logic: Sequential Circuits – Previous Year Questions
22 GATE previous year questions on Sequential Circuits (Digital Logic, Computer Science) with answers and explanations, from every paper.
22 questions worth 36 marks in all (8 1-mark, 14 2-mark). Asked between 2007 and 2026, so you can see how the topic has been tested over time.
- GATE 2007 CS Q36 – A4-bit counter has controls: Clear=1→clear0 (other inputs irrelevant); Clear=0, Load=0, Count=0→no change; Clear=0, rising clock, Load=1→load input;…
- GATE 2009 CS Q27 – An FSM has state bits A, B, one input and one output as shown below. Starting at A=0, B=0, what is the minimum input-string length that takes it to…
- GATE 2021 CS (CS2) Q38 – A synchronous circuit replaces the first 1 of every maximal run of consecutive ones by 0, leaving other bits unchanged. It is a two-state Mealy…
- GATE 2015 CS (CS2) Q17 – Find the minimum number of JK flip-flops for a synchronous counter with output sequence 0,0,1,1,2,2,3,3,0,0,… .
- GATE 2010 CS Q42 – Two positive-edge-triggered T flip-flops have T=1. The external clock drives flip-flop 0, whose Q₀ output clocks flip-flop 1. Starting from Q₁Q₀=00,…
- GATE 2011 CS Q25 – How many flip-flops are minimally required for a modulo-258 counter?
- GATE 2011 CS Q60 – The three D flip-flops form the shown counter. Immediately before a clock edge P,Q,R=0,1,0. Find PQR after the edge.
- GATE 2011 CS Q61 – All three flip-flops in the shown counter start zero. How many distinct PQR states are generated?
- GATE 2017 CS (CS2) Q52 – A synchronous two-bit saturating up-counter has transitions 00→01,01→10,10→11,11→11. With T flip-flops, find T₁,T₀.
- GATE 2014 CS (CS3) Q55 – The synchronous JK flip-flop circuit shown starts with Q₂Q₁Q₀ = 000. Find the state sequence for the next three clock cycles.
- GATE 2014 CS (CS2) Q17 – Let k=2n. An n-bit binary counter drives an n-to-2n decoder. This is equivalent to a .
- GATE 2017 CS (CS1) Q43 – Consider a combination of T and D flip-flops connected as shown below. The output of the D flip-flop is connected to the input of the T flip-flop and…
- GATE 2016 CS (CS1) Q18 – We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of J-K flip-flops required to…
- GATE 2015 CS (CS1) Q21 – Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is
- GATE 2015 CS (CS1) Q53 – A positive edge-triggered D flip-flop is connected to a positive edge-triggered JK flip-flop as follows. The Q output of the D flip-flop is connected…
- GATE 2018 CS Q32 – Consider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered D flip-flops (a serial chain with input…
- GATE 2026 CS (CS1) Q37 – Consider a 2-bit saturating up/down counter that performs the saturating up count when the input P is 0, and the saturating down count when P is 1.…
- GATE 2025 CS (CS2) Q34 – In a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64 microseconds, then the frequency of the ripple counter in kHz is…
- GATE 2025 CS (CS1) Q60 – Consider the given sequential circuit designed using D-Flip-flops. The circuit is initialized with some value (initial state). The number of distinct…
- GATE 2023 CS Q21 – The output of a 2-input multiplexer is connected back to one of its inputs as shown in the figure. Match the functional equivalence of this circuit to…
- GATE 2023 CS Q43 – Consider a sequential digital circuit consisting of T flip-flops and D flip-flops as shown in the figure. CLKIN is the clock input to the circuit. At…
- GATE 2021 CS (CS1) Q38 – Consider a 3-bit counter designed using T flip-flops as shown in the figure. All three flip-flops share the clock, and the toggle inputs are T P=R, T…