1
GATE CSE 2009
+1
-0.3
Which one of the following is FALSE?
A
There is a unique minimal $$DFA$$ for every regular language
B
Every $$NFA$$ can be converted to an equivalent $$PDA$$
C
Complement of every context free language is recursive
D
Every non deterministic $$PDA$$ can be converted to an equivalent deterministic $$PDA$$
2
GATE CSE 2009
+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
A
All palindromes
B
All odd length palindromes
C
Strings that begin and with same symbol
D
All even length palindromes
3
GATE CSE 2006
+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?
A
$${L_1}$$ only
B
$${L_3}$$ only
C
$${L_1}$$ and $${L_2}$$
D
$${L_2}$$ and $${L_3}$$
4
GATE CSE 2004
+1
-0.3
Which of the following grammar rules violate the requirements of an operator grammar ? $$P,$$ $$Q, R$$ are non-terminals and $$r, s, t$$ are terminals. \eqalign{ & 1)\,\,\,P \to Q\,R\,\,\,\,\,2)\,\,\,P \to Q\,s\,R \cr & 3)\,\,\,P \to c\,\,\,\,\,\,\,\,\,\,\,4)P \to Q\,t\,R\,r \cr}\$
A
$$(1)$$ only
B
$$(1)$$ and $$(3)$$ only
C
$$(2)$$ and $$(3)$$ only
D
$$(3)$$ and $$(4)$$ only
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization
EXAM MAP
Joint Entrance Examination