1

GATE CSE 2016 Set 1

Numerical

+1

-0

We want to design a synchronous counter that counts the sequence $$0-1-0-2-0-3$$ and then repeats. The minimum number of $$J-K$$ flip-flops required to implement this counter is _________.

Your input ____

2

GATE CSE 2015 Set 2

Numerical

+1

-0

The minimum number of $$JK$$ flip-flops required to construct a synchronous counter with the count sequence $$\left( {0,0,1,1,2,2,3,3,0,0,...} \right)$$ is ____________.

Your input ____

3

GATE CSE 2015 Set 1

MCQ (Single Correct Answer)

+1

-0.3

Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is

4

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

+1

-0.3

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

Questions Asked from Sequential Circuits (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages