1
GATE CSE 2026 Set 1
MCQ (More than One Correct Answer)
+1
-0
Consider the following grammar where $S$ is the start symbol, and $a$ and $b$ are terminal symbols.
$$ S \rightarrow a S b S|b S| \in $$
Which of the following statements is/are true?
2
GATE CSE 2025 Set 2
MCQ (Single Correct Answer)
+1
-0.33
Which ONE of the following languages is accepted by a deterministic pushdown automaton?
3
GATE CSE 2025 Set 2
MCQ (Single Correct Answer)
+1
-0.33
Let $G_1, G_2$ be Context Free Grammars (CFGs) and $R$ be a regular expression. For a grammar $G$, let $L(G)$ denote the language generated by $G$. Which ONE among the following questions is decidable?
4
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?
GATE CSE Subjects
Browse all chapters by subject
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