GATE CS 2021 (Afternoon) — Question 38

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

Suppose we want to design a synchronous circuit that processes a string of 0's and 1's. Given a string, it produces another string by replacing the first 1 in any subsequence of consecutive 1's by a 0. Consider the following example. Input sequence : 00100011000011100 Output sequence : 00000001000001100 A Mealy Machine is a state machine where both the next state and the output are functions of the present state and the current input. The above mentioned circuit can be designed as a two-state Mealy machine. The states in the Mealy machine can be represented using Boolean values 0 and 1. We denote the current state, the next state, the next incoming bit, and the output bit of the Mealy machine by the variables \(s\), \(t\), \(b\) and \(y\) respectively. Assume the initial state of the Mealy machine is 0. What are the Boolean expressions corresponding to \(t\) and \(y\) in terms of \(s\) and \(b\)?
  1. A
    \(t = s + b\) \(y = sb\)
  2. B
    \(t = b\) \(y = sb\)
  3. C
    \(t = b\) \(y = s\bar{b}\)
  4. D
    \(t = s + b\) \(y = s\bar{b}\)
Practise the full 2021-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