1
GATE CSE 2025 Set 2
MCQ (More than One Correct Answer)
+1
-0
Consider the two lists List-I and List-II given below:
List - I | List - II | ||
---|---|---|---|
(i) | Context free languages | (a) | Closed under union |
(ii) | Recursive languages | (b) | Not closed under complementation |
(iii) | Regular languages | (c) | Closed under intersection |
For matching of items in List-I with those in List-II, which of the following option(s) is/ are CORRECT?
2
GATE CSE 2025 Set 1
MCQ (Single Correct Answer)
+1
-0.33
Consider the following context-free grammar $G$, where $S, A$, and $B$ are the variables (nonterminals), $a$ and $b$ are the terminal symbols, $S$ is the start variable, and the rules of $G$ are described as:
$$\begin{aligned} & S \rightarrow a a B \mid A b b \\ & A \rightarrow a \mid a A \\ & B \rightarrow b \mid b B \end{aligned}$$
Which ONE of the languages $L(G)$ is accepted by $G$ ?
3
GATE CSE 2021 Set 2
MCQ (More than One Correct Answer)
+1
-0
Let L1 be a regular language and L2 be a context-free language. Which of the following languages is/are context-free?
4
GATE CSE 2021 Set 1
MCQ (Single Correct Answer)
+1
-0.33
Suppose that L1 is a regular and L2 is a context-free language, Which one of the following languages is NOT necessarily 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
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