My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Context-free Languages and Pushdown Automata - Theory of Computation - Computer Science & Information Technology Previous Year Questions

Practice Context-free Languages and Pushdown Automata - Theory of Computation - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

24Papers
17Years
41Questions
1Topics

Context-free Languages and Pushdown Automata question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Context-free Languages and Pushdown Automata. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 31 75.6%
Easy 8 19.5%
Hard 2 4.9%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 31 75.6%
MSQ 9 22%
Numerical Answer Type (NAT) 1 2.4%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
41 Qs

Most asked topics

Top topics across the included previous year papers.

Theory of Computation
41 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Context-free Languages and Pushdown Automata
41 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science and Information Technology (CS) 2026
2 Qs
Computer Science and Information Technology (CS) 2026
2 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
1 Qs
Computer Science & Information Technology (CS) 2010
1 Qs
Computer Science & Information Technology (CS) 2009
3 Qs
Computer Science & Information Technology (CS) 2008
2 Qs
Computer Science & Information Technology (CS) 2007
3 Qs

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science and Information Technology (CS) 202620262View paper
Computer Science and Information Technology (CS) 202620262View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20252View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20252View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20241View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20241View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20232View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20222View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20211View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20212View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20202View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20191View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20181View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20173View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20162View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20162View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20141View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20131View paper
Computer Science & Information Technology (CS) 201020101View paper
Computer Science & Information Technology (CS) 200920093View paper
Computer Science & Information Technology (CS) 200820082View paper
Computer Science & Information Technology (CS) 200720073View paper

All Context-free Languages and Pushdown Automata previous year questions

Practice every matching question in batches of 20, with every available option.

1
2007 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2007
The language L = { 0²¹ᵢ | i ≥ 0 } over the alphabet {0, 1, 2} is
Open complete paper
2
2007 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2007
Which of the following strings is generated by the grammar?
Open complete paper
3
2007 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2007

For the correct answer string to Q.78, how many derivation trees are there?

Open complete paper
4
2008 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2008
Which of the following statements are true?
I. Every left-recursive grammar can be converted to a right-recursive grammar and vice-versa
II. All ε-productions can be removed from any context-free grammar by suitable transformations
III. The language generated by a context-free grammar all of whose productions are of the form X → w or X → wY (where, w is a string of terminals and Y is a non-terminal), is always regular
IV. The derivation trees of strings generated by a context-free grammar in Chomsky Normal Form are always binary trees
Open complete paper
5
2008 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2008
Match the following:
Open complete paper
6
2009 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2009
\(S \rightarrow aSa \mid bSb \mid a \mid b\)
The language generated by the above grammar over the alphabet {a, b} is the set of
Open complete paper
7
2009 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2009
Which one of the following is FALSE ?
Open complete paper
8
2009 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2009
Let L = L1 ∩ L2, where L1 and L2 are languages as defined below :
L1 = {ambmcnanbn | m, n ≥ 0}
L2 = {aibjck | i, j, k ≥ 0}
Then L is
Open complete paper
9
2010 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2010
Consider the languages \(L1 = \{ 0^i 1^j \mid i \ne j \}\), \(L2 = \{0^i 1^j \mid i = j \}\), \(L3 = \{0^i 1^j \mid i = 2j+1 \}\), \(L4 = \{0^i 1^j \mid i \ne 2j \}\). Which one of the following statements is true?
Open complete paper
10
2013 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2013 [Session 1]
Consider the following languages. L₁ = {0ᵖ 1ᵖ 0ᵗ | p, q, r ≥ 0} L₂ = {0ᵖ 1ᵗ 0ᵗ | p, q, r ≥ 0, p≠r} Which one of the following statements is FALSE?
Open complete paper
11
2013 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2013 [Session 3]
Consider the following languages.
\(L_1 = \{0^p 1^q 0^r \mid p,q,r \ge 0\}\)
\(L_2 = \{0^p 1^q 0^r \mid p,q,r \ge 0, p \neq r\}\)

Which one of the following statements is FALSE?
Open complete paper
12
2013 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2013 [Session 4]
Consider the following languages.
\(L_1 = \{0^p 1^q 0^r \mid p,q,r \ge 0\}\)
\(L_2 = \{0^p 1^q 0^r \mid p,q,r \ge 0, p \ne r\}\)
Which one of the following statements is FALSE?
Open complete paper
13
2014 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2014 [Session 3]
Consider the following languages over the alphabet \(\Sigma = \{0,1,c\}\):
\(L_1 = \{0^n 1^n \mid n \geq 0\}\)
\(L_2 = \{wcw^r \mid w \in \{0,1\}^*\}\)
\(L_3 = \{ww^r \mid w \in \{0,1\}^*\}\)
Here, \(w^r\) is the reverse of the string \(w\). Which of these languages are deterministic Context-free languages?
Open complete paper
14
2016 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2016 [Session 1]
Consider the following context-free grammars:
G1: S → aS | B, B → b | bB
G2: S → aA | bB, A → aA | B | ε, B → bB | ε
Which one of the following pairs of languages is generated by G1 and G2, respectively?
Open complete paper
15
2016 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2016 [Session 1]
Consider the transition diagram of a PDA given below with input alphabet \(\Sigma = \{a, b\}\) and stack alphabet \(\Gamma = \{X, Z\}\). \(Z\) is the initial stack symbol. Let \(L\) denote the language accepted by the PDA.

Which one of the following is TRUE?

Question diagram

Open complete paper
16
2016 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2016 [Session 2]
Consider the following context-free grammars:
G_1: S → aS | B, B → b | bB
G_2: S → aA | bB, A → aA | B | ε, B → bB | ε
Which one of the following pairs of languages is generated by G_1 and G_2, respectively?
Open complete paper
17
2017 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2017 [Session 2]
Let \(L_1, L_2\) be any two context-free languages and \(R\) be any regular language. Then which of the following is/are CORRECT?
I. \(L_1 \cup L_2\) is context-free.
II. \(\overline{L_1}\) is context-free.
III. \(L_1 - R\) is context-free.
IV. \(L_1 \cap L_2\) is context-free.
Open complete paper
18
2017 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2017 [Session 2]
Identify the language generated by the following grammar, where \( S \) is the start variable. \[ S \rightarrow XY \\ X \rightarrow aX \mid a \\ Y \rightarrow aYb \mid \epsilon \]
Open complete paper
19
2017 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2017 [Session 2]
Consider the following languages.
\( L_1 = \{a^p \mid p \text{ is a prime number}\} \)
\( L_2 = \{a^n b^m c^{2m} \mid n \geq 0, m \geq 0\} \)
\( L_3 = \{a^n b^n c^{2n} \mid n \geq 0\} \)
\( L_4 = \{a^n b^n \mid n \geq 1\} \)
Which of the following are CORRECT?
I. \( L_1 \) is context-free but not regular.
II. \( L_2 \) is not context-free.
III. \( L_3 \) is not context-free but recursive.
IV. \( L_4 \) is deterministic context-free.
Open complete paper
20
2018 · Computer Science & Information Technology · Theory of Computation · Context-free Languages and Pushdown Automata
Computer Science & Information Technology (CS) 2018 [Session 2]
Consider the following languages:
I. \(\{a^m b^n c^p d^q \mid m + p = n + q, \text{ where } m, n, p, q \ge 0\}\)
II. \(\{a^m b^n c^p d^q \mid m = n \text{ and } p = q, \text{ where } m, n, p, q \ge 0\}\)
III. \(\{a^m b^n c^p d^q \mid m = n = p \text{ and } p \neq q, \text{ where } m, n, p, q \ge 0\}\)
IV. \(\{a^m b^n c^p d^q \mid mn = p + q, \text{ where } m, n, p, q \ge 0\}\)
Which of the languages above are context-free?
Open complete paper

Showing 20 of 40 questions