GATE CS 2025 (Afternoon) — Question 30

Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMSQ1 markMedium

Consider the two lists List-I and List-II given below: List-I (i) Context free languages (ii) Recursive languages (iii) Regular languages List-II (a) Closed under union (b) Not closed under complementation (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?
  1. A
    (i) - (a), (ii) - (b), and (iii) - (c)
  2. B
    (i) - (b), (ii) - (a), and (iii) - (c)
  3. C
    (i) - (b), (ii) - (c), and (iii) - (a)
  4. D
    (i) - (a), (ii) - (c), and (iii) - (b)
Practise the full 2025-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
Practise more on Regular and Context-Free Languages & Pumping LemmaTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group