1

GATE CSE 2003

MCQ (Single Correct Answer)

+2

-0.6

Consider the following deterministic finite state automation $$M.$$

Let $$S$$ denote the set of seven bit binary strings in which the first, the fourth, and the last bits are $$1$$. The number of strings in $$S$$ that are accepted by $$M$$ is

2

GATE CSE 2002

MCQ (Single Correct Answer)

+2

-0.6

The smallest finite automaton which accepts the language

$$L = \left. {\left\{ x \right.} \right|$$ length of $$x$$ is divisible by $$\left. 3 \right\}$$ has

$$L = \left. {\left\{ x \right.} \right|$$ length of $$x$$ is divisible by $$\left. 3 \right\}$$ has

3

GATE CSE 2002

MCQ (Single Correct Answer)

+2

-0.6

The Finite state machine described by the following state diagram with $$A$$ as starting state, where an arc label is $$x/y$$ and $$x$$ stands for $$1-bit$$ input and $$y$$ stands for $$2$$-bit output

4

GATE CSE 2001

MCQ (Single Correct Answer)

+2

-0.6

Consider a $$DFA$$ over $$\sum { = \left\{ {a,\,\,b} \right\}} $$ accepting all strings which have number of $$a'$$s divisible by $$6$$ and number of $$b'$$s divisible by $$8$$. What is the minimum number of states that the $$DFA$$ will have?

Questions Asked from Finite Automata and Regular Language (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2024 Set 2 (2)
GATE CSE 2024 Set 1 (2)
GATE CSE 2023 (1)
GATE CSE 2021 Set 1 (1)
GATE CSE 2020 (1)
GATE CSE 2018 (2)
GATE CSE 2016 Set 2 (2)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 1 (2)
GATE CSE 2015 Set 2 (3)
GATE CSE 2014 Set 1 (1)
GATE CSE 2014 Set 2 (2)
GATE CSE 2013 (1)
GATE CSE 2012 (1)
GATE CSE 2011 (1)
GATE CSE 2010 (2)
GATE CSE 2009 (2)
GATE CSE 2008 (3)
GATE CSE 2007 (4)
GATE CSE 2006 (2)
GATE CSE 2005 (1)
GATE CSE 2004 (1)
GATE CSE 2003 (2)
GATE CSE 2002 (2)
GATE CSE 2001 (2)
GATE CSE 2000 (1)
GATE CSE 1998 (1)
GATE CSE 1997 (1)
GATE CSE 1995 (2)
GATE CSE 1994 (2)
GATE CSE 1992 (2)
GATE CSE 1991 (1)
GATE CSE 1990 (1)
GATE CSE 1989 (1)

GATE CSE Subjects

Discrete Mathematics

Programming Languages

Theory of Computation

Operating Systems

Computer Organization

Database Management System

Data Structures

Computer Networks

Algorithms

Compiler Design

Software Engineering

Web Technologies

General Aptitude