GATE CSE 2025 Session 2 Q30: Match language classes to closure properties
- Theory of Computation
- 1 mark
- MSQ
- No negative marking
Question
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?
Try it: multiple select: one or more correct options
Show answer and explanation
Answer: B, C (official GATE 2025 final answer key)
Concept used: An option is correct when every pair in it is a true statement; CFLs are closed under union but not complement, while recursive and regular languages are closed under all three operations.
First step: Mark each of the nine pairs true or false, then keep the options whose three pairs are all true.
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2025 Session 2 CS question paper and final answer key, organised by IIT Roorkee. Question paper · Answer key
More Theory of Computation PYQs
- 2026 Session 1 · Q25Ambiguity of S → aSbS | bS | ε
- 2026 Session 1 · Q26Impossible minimal DFA sizes for a 6-state NFA
- 2026 Session 1 · Q51What follows from L1 ∩ L2 and L2 being regular
- 2026 Session 1 · Q52Counts of a's and b's in strings of a given CFG
- 2026 Session 2 · Q13Meaning of a Turing machine deciding a language
- 2026 Session 2 · Q29Which of four grammars are ambiguous