My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Theory of Computation - Computer Science & Information Technology Previous Year Questions

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

24Papers
14Years
115Questions
1Topics

Theory of Computation question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Theory of Computation. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 88 76.5%
Easy 20 17.4%
Hard 7 6.1%

Question type distribution

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

MCQ 79 68.7%
MSQ 19 16.5%
Numerical Answer Type (NAT) 17 14.8%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
115 Qs

Most asked topics

Top topics across the included previous year papers.

Theory of Computation
115 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Regular Languages and Finite Automata
57 Qs
Context-free Languages and Pushdown Automata
32 Qs
Turing Machines and Undecidability
26 Qs

Paper coverage

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

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

Browse by subtopics

Open a focused page built from the same verified paper data.

Regular Languages and Finite Automata

Explore previous-paper coverage, trends and focused practice for Regular Languages and Finite Automata.

57 questions23 papers14 years

Context-free Languages and Pushdown Automata

Explore previous-paper coverage, trends and focused practice for Context-free Languages and Pushdown Automata.

32 questions20 papers13 years

Turing Machines and Undecidability

Explore previous-paper coverage, trends and focused practice for Turing Machines and Undecidability.

26 questions16 papers10 years

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) 202620264View paper
Computer Science and Information Technology (CS) 202620264View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20256View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20255View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20244View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20243View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20236View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20225View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20214View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20216View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20206View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20195View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20186View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20176View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20166View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20166View paper
Computer Science & Information Technology (CS) 2015 [Session 2]20151View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20144View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20144View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20145View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20136View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20136View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20136View paper

Sample previous year questions

A varied preview from the papers represented in this selection, with every available option.

1
2013 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2013 [Session 1]
Consider the languages \(L_1 = \Phi\) and \(L_2 = \{a\}\). Which one of the following represents \(L_1 L_2^* \cup L_1^*\)?
Open complete paper
2
2013 · Computer Science & Information Technology · Theory of Computation · Turing Machines and Undecidability
Computer Science & Information Technology (CS) 2013 [Session 2]
Which of the following statements is/are FALSE?
1. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.
2. Turing recognizable languages are closed under union and complementation.
3. Turing decidable languages are closed under intersection and complementation.
4. Turing recognizable languages are closed under union and intersection.
Open complete paper
3
2013 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2013 [Session 3]
Consider the languages L₁=Φ and L₂={a}. Which one of the following represents L₁ L₂* ∪ L₁*?
Open complete paper
4
2014 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2014 [Session 1]
Which one of the following is TRUE?
Open complete paper
5
2014 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2014 [Session 2]
If \(L_1 = \{a^n | n \geq 0\}\) and \(L_2 = \{b^n | n \geq 0\}\), consider
(I) \(L_1 \cdot L_2\) is a regular language
(II) \(L_1 \cdot L_2 = \{a^n b^n | n \geq 0\}\)
Which one of the following is CORRECT?
Open complete paper