Difficulty distribution
How the classified questions are distributed by difficulty.
Your cart is empty.
Practice Theory of Computation - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.
Every graph below is calculated only from this selection.
Compare question counts across years.
How the classified questions are distributed by difficulty.
MCQ, numerical, multiple-select and other formats found in these papers.
Top subjects by unique question coverage.
Top topics across the included previous year papers.
Top subtopics inside this exact selection.
Question coverage for the most populated papers. Every active PYP paper remains listed below.
Open a focused page built from the same verified paper data.
Explore previous-paper coverage, trends and focused practice for Regular Languages and Finite Automata.
Explore previous-paper coverage, trends and focused practice for Context-free Languages and Pushdown Automata.
Explore previous-paper coverage, trends and focused practice for Turing Machines and Undecidability.
Newest papers appear first. Search these papers or sort by year and name.
| Paper name | Year | Attempt | |
|---|---|---|---|
Computer Science and Information Technology (CS) 20262026 | 2026 |
|
|
Computer Science and Information Technology (CS) 20262026 | 2026 | |
|
Computer Science & Information Technology (CS) 2025 [Session 1]2025 | 2025 | |
|
Computer Science & Information Technology (CS) 2025 [Session 2]2025 | 2025 | |
|
Computer Science & Information Technology (CS) 2024 [Session 1]2024 | 2024 | |
|
Computer Science & Information Technology (CS) 2024 [Session 2]2024 | 2024 | |
|
Computer Science & Information Technology (CS) 2023 [Session 2]2023 | 2023 | |
|
Computer Science & Information Technology (CS) 2022 [Session 2]2022 | 2022 | |
|
Computer Science & Information Technology (CS) 2021 [Session 1]2021 | 2021 | |
|
Computer Science & Information Technology (CS) 2021 [Session 2]2021 | 2021 | |
|
Computer Science & Information Technology (CS) 2020 [Session 2]2020 | 2020 | |
|
Computer Science & Information Technology (CS) 2019 [Session 2]2019 | 2019 | |
|
Computer Science & Information Technology (CS) 2018 [Session 2]2018 | 2018 | |
|
Computer Science & Information Technology (CS) 2017 [Session 2]2017 | 2017 | |
|
Computer Science & Information Technology (CS) 2016 [Session 1]2016 | 2016 | |
|
Computer Science & Information Technology (CS) 2016 [Session 2]2016 | 2016 | |
|
Computer Science & Information Technology (CS) 2015 [Session 2]2015 | 2015 | |
|
Computer Science & Information Technology (CS) 2014 [Session 1]2014 | 2014 | |
|
Computer Science & Information Technology (CS) 2014 [Session 2]2014 | 2014 | |
|
Computer Science & Information Technology (CS) 2014 [Session 3]2014 | 2014 | |
|
Computer Science & Information Technology (CS) 2013 [Session 1]2013 | 2013 | |
|
Computer Science & Information Technology (CS) 2013 [Session 2]2013 | 2013 | |
|
Computer Science & Information Technology (CS) 2013 [Session 3]2013 | 2013 | |
|
Computer Science & Information Technology (CS) 2013 [Session 4]2013 | 2013 | |
|
Computer Science & Information Technology (CS) 20112011 | 2011 | |
|
Computer Science & Information Technology (CS) 20102010 | 2010 | |
|
Computer Science & Information Technology (CS) 20092009 | 2009 | |
|
Computer Science & Information Technology (CS) 20082008 | 2008 | |
|
Computer Science & Information Technology (CS) 20072007 | 2007 | |
|
A varied preview from the papers represented in this selection, with every available option.
Let G be the non-planar graph with the minimum possible number of edges. Then G has
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?