The GATE Grind

GATE 2014 CS (CS2) – Question 17

Digital Logic · Sequential Circuits · 1 mark · Multiple choice

Let $k=2^n$. An n-bit binary counter drives an n-to-$2^n$ decoder. This is equivalent to a ______.

  1. k-bit binary up counter
  2. k-bit binary down counter
  3. k-bit ring counter
  4. k-bit Johnson counter

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) k-bit ring counter

Explanation

An n-bit counter cycles through2ⁿ=kstates. Its n-to-2ⁿdecoder activates exactly one of koutputs for each state, moving the active output cyclically. This is equivalent to a **k-bit ring counter,C**. The decoder outputs are one-hot rather than a k-bit binary count.