1

GATE CSE 2020

MCQ (Single Correct Answer)

+1

-0.33

Which one of the following regular expressions represents the set of all binary strings with an odd number of 1’s?

2

GATE CSE 2019

MCQ (Single Correct Answer)

+1

-0.33

If L is a regular language over Σ = {a,b}, which one of the following languages is NOT regular?

3

GATE CSE 2019

MCQ (Single Correct Answer)

+1

-0.33

For Σ = {a, b}, let us consider the regular language L = {x | x = a

^{2+3k}or x = b^{10+12k}, k ≥ 0}. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L?4

GATE CSE 2016 Set 2

Numerical

+1

-0

The number of states in the minimum sized $$DFA$$ that accepts the language defined by the regular expression
$$${\left( {0 + 1} \right)^ * }\left( {0 + 1} \right){\left( {0 + 1} \right)^ * }$$$

is ___________________.

is ___________________.

Your input ____

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

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2022 (1)
GATE CSE 2020 (2)
GATE CSE 2019 (2)
GATE CSE 2016 Set 2 (2)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 3 (1)
GATE CSE 2014 Set 1 (2)
GATE CSE 2013 (1)
GATE CSE 2012 (1)
GATE CSE 2010 (1)
GATE CSE 2009 (1)
GATE CSE 2003 (2)
GATE CSE 2001 (2)
GATE CSE 2000 (2)
GATE CSE 1999 (1)
GATE CSE 1998 (4)
GATE CSE 1997 (1)
GATE CSE 1996 (2)
GATE CSE 1994 (1)

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