1

GATE CSE 2011

MCQ (Single Correct Answer)

+1

-0.3

The lexical analysis for a modern computer language such as java needs the power of which one of the following machine model in a necessary and sufficient sense?

2

GATE CSE 2009

MCQ (Single Correct Answer)

+1

-0.3

Which one of the following is FALSE?

3

GATE CSE 2009

MCQ (Single Correct Answer)

+1

-0.3

$$S \to aSa\,\left| {\,bSb\,\left| {\,a\,\left| {\,b} \right.} \right.} \right.$$

The language generated by the above grammar over the alphabet $$\left\{ {a,\,b} \right\}$$ is the set of

The language generated by the above grammar over the alphabet $$\left\{ {a,\,b} \right\}$$ is the set of

4

GATE CSE 2006

MCQ (Single Correct Answer)

+1

-0.3

Let $${L_1} = \left\{ {{0^{n + m}}{1^n}{0^m}\left| {n,m \ge 0} \right.} \right\},$$

$$\,\,\,{L_2} = \left\{ {{0^{n + m}}{1^{n + m}}{0^m}\left| {n,m \ge 0} \right.} \right\},$$ and

$$\,\,\,\,{L_3} = \left\{ {{0^{n + m}}{1^{n + m}}{0^{n + m}}\left| {n,m \ge 0} \right.} \right\},$$ Which of these languages are NOT context free?

$$\,\,\,{L_2} = \left\{ {{0^{n + m}}{1^{n + m}}{0^m}\left| {n,m \ge 0} \right.} \right\},$$ and

$$\,\,\,\,{L_3} = \left\{ {{0^{n + m}}{1^{n + m}}{0^{n + m}}\left| {n,m \ge 0} \right.} \right\},$$ Which of these languages are NOT context free?

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

Number in Brackets after Paper Indicates No. of Questions

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