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.

29Papers
19Years
149Questions
1Topics

Theory of Computation question pattern

Every graph below is calculated only from this selection.

Questions by year

Compare question counts across years.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 113 75.8%
Easy 28 18.8%
Hard 8 5.4%

Question type distribution

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

MCQ 112 75.2%
MSQ 20 13.4%
Numerical Answer Type (NAT) 17 11.4%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
149 Qs

Most asked topics

Top topics across the included previous year papers.

Theory of Computation
149 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Regular Languages and Finite Automata
75 Qs
Context-free Languages and Pushdown Automata
42 Qs
Turing Machines and Undecidability
32 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
Computer Science & Information Technology (CS) 2011
4 Qs
Computer Science & Information Technology (CS) 2010
4 Qs
Computer Science & Information Technology (CS) 2009
6 Qs
Computer Science & Information Technology (CS) 2008
10 Qs
Computer Science & Information Technology (CS) 2007
10 Qs

Browse by subtopics

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

Included previous year papers

Newest papers appear first. Search these papers or sort by year and name.

Paper nameYearPDFAttempt
Computer Science and Information Technology (CS) 20262026
4 questions in this view
2026
Computer Science and Information Technology (CS) 20262026
4 questions in this view
2026
Computer Science & Information Technology (CS) 2025 [Session 1]2025
6 questions in this view
2025
Computer Science & Information Technology (CS) 2025 [Session 2]2025
5 questions in this view
2025
Computer Science & Information Technology (CS) 2024 [Session 1]2024
4 questions in this view
2024
Computer Science & Information Technology (CS) 2024 [Session 2]2024
3 questions in this view
2024
Computer Science & Information Technology (CS) 2023 [Session 2]2023
6 questions in this view
2023
Computer Science & Information Technology (CS) 2022 [Session 2]2022
5 questions in this view
2022
Computer Science & Information Technology (CS) 2021 [Session 1]2021
4 questions in this view
2021
Computer Science & Information Technology (CS) 2021 [Session 2]2021
6 questions in this view
2021
Computer Science & Information Technology (CS) 2020 [Session 2]2020
6 questions in this view
2020
Computer Science & Information Technology (CS) 2019 [Session 2]2019
5 questions in this view
2019
Computer Science & Information Technology (CS) 2018 [Session 2]2018
6 questions in this view
2018
Computer Science & Information Technology (CS) 2017 [Session 2]2017
6 questions in this view
2017
Computer Science & Information Technology (CS) 2016 [Session 1]2016
6 questions in this view
2016
Computer Science & Information Technology (CS) 2016 [Session 2]2016
6 questions in this view
2016
Computer Science & Information Technology (CS) 2015 [Session 2]2015
1 questions in this view
2015
Computer Science & Information Technology (CS) 2014 [Session 1]2014
4 questions in this view
2014
Computer Science & Information Technology (CS) 2014 [Session 2]2014
4 questions in this view
2014
Computer Science & Information Technology (CS) 2014 [Session 3]2014
5 questions in this view
2014
Computer Science & Information Technology (CS) 2013 [Session 1]2013
6 questions in this view
2013
Computer Science & Information Technology (CS) 2013 [Session 2]2013
1 questions in this view
2013
Computer Science & Information Technology (CS) 2013 [Session 3]2013
6 questions in this view
2013
Computer Science & Information Technology (CS) 2013 [Session 4]2013
6 questions in this view
2013
Computer Science & Information Technology (CS) 20112011
4 questions in this view
2011
Computer Science & Information Technology (CS) 20102010
4 questions in this view
2010
Computer Science & Information Technology (CS) 20092009
6 questions in this view
2009
Computer Science & Information Technology (CS) 20082008
10 questions in this view
2008
Computer Science & Information Technology (CS) 20072007
10 questions in this view
2007

Sample previous year questions

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

1
2007 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2007

Let G be the non-planar graph with the minimum possible number of edges. Then G has

Open complete paper
2
2008 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2008
Which of the following is true for the language \(\{ a^p \mid p \text{ is a prime} \}\)?
Open complete paper
3
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
4
2010 · Computer Science & Information Technology · Theory of Computation · Turing Machines and Undecidability
Computer Science & Information Technology (CS) 2010

Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?

Open complete paper
5
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
6
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