Computer Sciences > GATE 2025 SET-1 > Sequential Circuits
Consider the given sequential circuit designed using D-Flip-flops. The circuit is initialized with some value (initial state). The number of distinct states the circuit will go through before returning back to the initial state is ______ (Answer in integer)

Correct : 7

The correct answer is 7 (excluding the initial state) or 8 (including it).
For a D flip-flop, the characteristic equation is Qnext = D. From the circuit, the next-state equations are:
• Q0(next) = Q̅3
• Q1(next) = Q0
• Q2(next) = Q1
• Q3(next) = Q2
Starting from initial state 0000 and applying these equations at each clock cycle:
0000 → 0001 → 0011 → 0111 → 1110 → 1100 → 1000 → 0000
The circuit visits 7 distinct states (0001, 0011, 0111, 1110, 1100, 1000, and back to 0000) before returning to the initial state.
This is a classic Linear Feedback Shift Register (LFSR)-type circuit where Q̅3 feeds back to Q0, creating a cycle of length 7 (excluding the all-zero lock-up state).

Similar Questions

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 implement this c...
#579 Fill in the Blanks
Consider a 3-bit counter, designed using T flip-flops, as shown below: Assuming the initial state of the counter given by PQR as 000, what are the next three...
#1028 MCQ
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. The Next Sta...
#1523 MCQ

Related Topics

GATE CS 2025 GATE CS 2025 Set-1 Q60 D Flip-Flop Sequential Circuit Distinct States State Transition Diagram Digital Logic GATE Synchronous Circuit Counter States State Cycle GATE CS Digital Logic GATE 2025 CS Solved Flip-Flop Next State State Machine

Unique Visitor Count

Total Unique Visitors

Loading......