Home / Courses / IIT JAM Physics / Practice / Flip-flops, counters and registers

Flip-flops, counters and registers

Electronics · 19 questions and templates for IIT JAM Physics, in order from warm-up to top rank. Check each answer, then read the full solution.

Loading questions… (they need JavaScript; nothing you type is sent anywhere)

Written questions with solutions

The same questions as a list, so you can print them or read without the practice box. Templates (fresh numbers) appear only in the practice box above.

  1. MCQWarm-up

    For an SR latch built from two cross-coupled NOR gates, which input combination is not allowed?
    1. S=0,R=0
    2. S=1,R=0
    3. S=1,R=1
    4. S=0,R=1
    Answer and solution

    Answer: C

    With both inputs 1, both NOR outputs are forced to 0, so Q and Q‾ are no longer complements; and when both inputs return to 0 together the final state depends on which gate is faster. S=R=0 holds the state. (For a NAND latch the forbidden pair is S=R=0 on its active-low inputs.)

    Why people get this wrong: S=R=0 is the memory (hold) condition for a NOR latch.

  2. MCQWarm-up

    An edge-triggered JK flip-flop has J=K=1. At each active clock edge its output
    1. toggles (changes to the opposite state)
    2. resets to 0
    3. sets to 1
    4. stays the same
    Answer and solution

    Answer: A

    The JK characteristic equation Q+=JQ‾+K‾Q gives Q+=Q‾ for J=K=1. This is how a JK flip-flop becomes a T flip-flop and a divide-by-2.

    Why people get this wrong: Thinking J=K=1 is forbidden as in the SR latch; resolving that problem is the reason the JK exists.

  3. MCQWarm-up

    The minimum number of flip-flops for a binary counter that counts through 12 states (mod-12) is
    1. 3
    2. 12
    3. 6
    4. 4
    Answer and solution

    Answer: D

    n flip-flops give 2n states. 23=8<12≤16=24, so 4 are needed (4 of the 16 states unused).

    Why people get this wrong: A ring counter would need 12 and a Johnson counter 6, but the question asks for a binary counter.

  4. NATWarm-up

    A Johnson (twisted-ring) counter is built with 5 flip-flops. The number of distinct states in its normal sequence is ______.
    Answer and solution

    Answer: 10

    In a Johnson counter the complement of the last output is fed back to the first. Ones fill in from one end and then zeros: 2n=10 states for n=5. A plain ring counter with one circulating 1 has only n=5.

    Why people get this wrong: Confusing it with the ring counter (5) or a binary counter (32).

  5. MCQWarm-up

    The characteristic equation of a D flip-flop is
    1. Q+=DQ‾
    2. Q+=D
    3. Q+=D⊕︎Q
    4. Q+=D‾
    Answer and solution

    Answer: B

    At the clock edge the output takes the value of D, whatever it was before. So Q+=D. D⊕︎Q is the T flip-flop with T=D.

    Why people get this wrong: The D flip-flop has no hold input: holding needs D=Q fed back (or a clock enable).

  6. MSQWarm-up

    Which statements comparing ripple (asynchronous) and synchronous counters are correct?
    1. In a synchronous counter every flip-flop is clocked by the same clock
    2. In a ripple counter the propagation delays add up along the chain
    3. Decoding the outputs of a ripple counter can give short false pulses (glitches)
    4. Synchronous counters need no logic gates at all
    Answer and solution

    Answer: A, B, C

    Ripple counters clock each flip-flop from the previous output, so the last one changes n delays after the clock and passes through wrong intermediate states (011 goes to 010, 000, then 100). A synchronous counter changes all bits together, but it needs gates to decide which bits toggle.

    Why people get this wrong: Synchronous counters trade gates for speed and clean outputs.

  7. MCQWarm-up

    A state machine has 10 states. With one-hot encoding (exactly one flip-flop set per state), it needs
    1. 4 flip-flops
    2. 10 flip-flops
    3. 5 flip-flops
    4. 1024 flip-flops
    Answer and solution

    Answer: B

    One-hot gives each state its own flip-flop, so 10 states need 10 flip-flops. Binary encoding would need only ⌈log2⁡10⌉=4, but one-hot makes the next-state and output logic simpler and faster, which is why it is common in FPGAs.

    Why people get this wrong: 4 is the binary-encoded count; the question fixes the encoding.

  8. NATStandard

    A 4-bit binary ripple counter is clocked at 16 kHz. The frequency of the square wave at its most significant output is ______ kHz.
    Answer and solution

    Answer: 1 kHz

    Each flip-flop divides by 2, so the fourth output runs at 16/24=1 kHz, with a 50% duty cycle.

    Why people get this wrong: Dividing by 4 (the number of flip-flops) instead of 24.

  9. MCQStandard

    The characteristic equation of a JK flip-flop is
    1. Q+=J+KQ
    2. Q+=JK+Q‾
    3. Q+=JQ‾+K‾Q
    4. Q+=J⊕︎K
    Answer and solution

    Answer: C

    From the table: JK=00 holds (Q+=Q), 10 sets, 01 resets, 11 toggles. The K-map of Q+ against J,K,Q simplifies to JQ‾+K‾Q: set when 0 if J=1, stay 1 unless K=1.

    Why people get this wrong: Check the toggle case: J=K=1 must give Q‾.

  10. MCQStandard

    To make a T flip-flop from a JK flip-flop, connect
    1. J=T and K=T‾
    2. J=K=T
    3. J=T and K=0
    4. J=Q‾ and K=T
    Answer and solution

    Answer: B

    With J=K=T: T=0 gives hold, T=1 gives toggle, exactly the T flip-flop. J=T, K=T‾ gives a D flip-flop instead.

    Why people get this wrong: J=D, K=D‾ is the JK-to-D conversion.

  11. NATStandard

    A 4-bit ripple up-counter has its asynchronous clear driven by a NAND gate whose inputs are Q3 and Q1 (Q0 is the least significant bit). Starting from 0000, it cycles through how many stable states?
    Answer and solution

    Answer: 10

    The first count with Q3=Q1=1 is 1010 = 10. As soon as it appears the counter clears to 0000, so 1010 lasts only a few nanoseconds. Stable states: 0 to 9: a decade (mod-10) counter.

    Why people get this wrong: Counting the momentary state 1010 as an eleventh state.

  12. MCQStandard

    A level-triggered JK flip-flop with J=K=1 suffers the race-around condition when
    1. the clock is high for longer than the flip-flop's propagation delay, so it toggles more than once per pulse
    2. the clock is too slow overall
    3. the inputs change after the clock goes low
    4. it is replaced by an edge-triggered device
    Answer and solution

    Answer: A

    While the clock is high the flip-flop is transparent: it toggles, the new output feeds back through J, K and toggles it again, repeatedly, until the clock falls. The final state is unpredictable. Master-slave and edge-triggered designs allow only one change per clock.

    Why people get this wrong: The fix is a short sampling window, not a slower clock.

  13. MCQStandard

    What distinguishes a D latch from an edge-triggered D flip-flop?
    1. The latch has no enable input
    2. The latch can only store a 1
    3. The latch is transparent: its output follows D for as long as the enable is active, while the flip-flop samples D only at the clock edge
    4. There is no difference in behaviour
    Answer and solution

    Answer: C

    A latch is level sensitive; a flip-flop is edge sensitive. In a pipeline of latches clocked together, data could race through several stages in one clock phase; flip-flops prevent that.

    Why people get this wrong: Both store one bit; the difference is when they listen to the input.

  14. MCQStandard

    A ring counter of 6 flip-flops holds a single 1 that circulates, clocked at 12 MHz. The waveform at any one flip-flop output has
    1. frequency 2 MHz and duty cycle 1/6
    2. frequency 2 MHz and duty cycle 50%
    3. frequency 1 MHz and duty cycle 50%
    4. frequency 12 MHz and duty cycle 1/6
    Answer and solution

    Answer: A

    The single 1 returns to the same flip-flop every 6 clocks, so each output repeats at 12/6=2 MHz. It is high for 1 clock out of 6: duty cycle 1/6. (A Johnson counter of the same length would give 50% duty at 1 MHz.)

    Why people get this wrong: A 50% duty cycle belongs to the Johnson (twisted-ring) counter.

  15. NATExam level

    A seconds counter showing 00 to 59 in BCD is built as a decade counter (units digit) whose carry clocks a mod-6 counter (tens digit), each with the fewest flip-flops possible. The total number of flip-flops is ______.
    Answer and solution

    Answer: 7

    A decade counter needs ⌈log2⁡10⌉=4 flip-flops and a mod-6 counter ⌈log2⁡6⌉=3: 7 in all. A single binary mod-60 counter would need only ⌈log2⁡60⌉=6, but its output would not be BCD and would need conversion before driving a display.

    Why people get this wrong: ⌈log2⁡60⌉=6 is right for a binary counter, not for two separate BCD digits.

  16. MCQHard

    A mechanical switch bounces several times when pressed. A common way to get one clean transition is
    1. feed it to a T flip-flop
    2. use a single-pole double-throw switch driving an SR latch
    3. connect it directly to a counter
    4. add a second switch in series
    Answer and solution

    Answer: B

    The first contact with one throw sets (or resets) the latch; bounces on that same contact only repeat the same command, and the moving contact cannot reach the other throw during the bounce. The output changes once. (An RC filter plus Schmitt trigger is the other classic fix.)

    Why people get this wrong: A T flip-flop would toggle on every bounce.

← All topics · Timed mock test →