1
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
Consider the language
L = { $${a^n}|n \ge 0$$ } $$ \cup $$ { $${a^n}{b^n}|n \ge 0$$ }
and the following statements.

I. L is deterministic context-free.
II. L is context-free but not deterministic context-free.
III. L is not LL(k) for any k.

Which of the above statements is/are TRUE?
A
I only
B
II only
C
I and III only
D
III only
2
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which of the following languages is generated by the given grammar? $$$S \to aS|bS|\varepsilon $$$
A
$$\left\{ {{a^n}{b^m}|n,m \ge 0} \right\}$$
B
$$\left\{ {w \in \left\{ {a,b} \right\}{}^ * |w} \right.$$ has equal number of $$a’s$$ and $$\left. {b's} \right\}$$
C
$$\left\{ {{a^n}|n \ge 0} \right\} \cup \left\{ {{b^n}|n \ge 0} \right\} \cup \left\{ {{a^n}{b^n}|n \ge 0} \right\}$$
D
$${\left\{ {a,b} \right\}^ * }$$
3
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?
A
Finite state automata
B
Deterministic pushdown automata
C
Non -deterministic pushdown automata
D
Turing machine
4
GATE CSE 2009
MCQ (Single Correct Answer)
+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$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12