GATE CS 2017 (Afternoon) — Question 42

Digital LogicSequential Circuits (Flip-Flops, Registers, Counters)MCQ2 marks · −2/3 if wrongMedium

The next state table of a 2-bit saturating up-counter is given below.
Question image
The counter is built as a synchronous sequential circuit using T flip-flops. The expressions for \(T_1\) and \(T_0\) are
  1. A
    \(T_1 = Q_1 Q_0, T_0 = \bar{Q}_1 \bar{Q}_0\)
  2. B
    \(T_1 = \bar{Q}_1 Q_0, T_0 = \bar{Q}_1 + \bar{Q}_0\)
  3. C
    \(T_1 = Q_1 + Q_0, T_0 = \bar{Q}_1 + \bar{Q}_0\)
  4. D
    \(T_1 = Q_1 Q_0, T_0 = Q_1 + Q_0\)
Practise the full 2017-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkDiscrete Mathematics and Its Applications (Rosen)Logic, sets, relations, combinatorics and graph theory, with worked examples.
Practise more on Sequential Circuits (Flip-Flops, Registers, Counters)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group