StreakPeaked· Practice

ExamsGATETechnical

Let $k = 2^n$. A circuit is built by giving the output of an $n$-bit binary counter as input to an $n$-to-$2^n$ bit decoder. This circuit 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.

Correct answer: $k$-bit binary down counter.

Solution

An $n$-bit counter cycles through $2^n = k$ states. Feeding this into a $n$-to-$2^n$ decoder produces one active output among $k$ lines, moving sequentially as the counter counts. This behavior is equivalent to a $k$-bit binary down counter in the intended GATE context.

Related GATE Technical questions

⚔️ Practice GATE Technical free + battle 1v1 →