1

GATE CSE 2000

MCQ (Single Correct Answer)

+2

-0.6

Consider the following decision problems:

$${P_1}$$ Does a given finite state machine accept a given string

$${P_2}$$ Does a given context free grammar generate an infinite number of stings.

$${P_1}$$ Does a given finite state machine accept a given string

$${P_2}$$ Does a given context free grammar generate an infinite number of stings.

Which of the following statements is true?

2

GATE CSE 1999

MCQ (More than One Correct Answer)

+2

-0.6

If $${L_1}$$ is a context free language and $${L_2}$$ is a regular which of the following is/are false?

3

GATE CSE 1998

MCQ (Single Correct Answer)

+2

-0.6

Let $$L$$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimum state deterministic finite-state automation accepting $$L$$ is

4

GATE CSE 1998

MCQ (Single Correct Answer)

+2

-0.6

Which of the following statements is false?

Questions Asked from Push Down Automata and Context Free Language (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2021 Set 1 (4)
GATE CSE 2020 (1)
GATE CSE 2018 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2014 Set 3 (1)
GATE CSE 2013 (1)
GATE CSE 2011 (2)
GATE CSE 2010 (1)
GATE CSE 2008 (3)
GATE CSE 2007 (3)
GATE CSE 2006 (1)
GATE CSE 2005 (3)
GATE CSE 2004 (3)
GATE CSE 2000 (1)
GATE CSE 1999 (1)
GATE CSE 1998 (2)
GATE CSE 1997 (1)
GATE CSE 1996 (2)
GATE CSE 1994 (1)
GATE CSE 1992 (1)
GATE CSE 1989 (1)
GATE CSE 1987 (2)

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