| Theory of Computation | |||
| Easy | Medium | Difficult | |
| 2020 | 1. Context Free Language 2. Regular Language | 1. Regular Grammar 2. Regular Expression 3. DFA | — |
| 2018 | 1.Mis 2.PDA(2) 3.FSM | 1.Finite Automata | — |
| 2017(Dec) | 1.PDA | 1.FA 2.PDA(2) 3.Regular expression 4.TM 5.Undecidability 6.BT | — |
| 2017(May) | 1.Finite Automata 2.TM | — | — |
| 2016 | 1.Finite Automata(2) 2.RE 3.BST | 1.Regular expression 2.PDA 3.TM | — |
| 2015 | — | — | — |
| 2014 | 1.TM | 1.Finite Automata(4) 2.PDA(2) | — |
| 2013 | — | 1.Finite automata | — |
| 2011 | — | 1.PDA(2) 2.TM | — |
| 2009 | — | — | — |
| 2008 | — | 1.Grammer | — |
| 2007 | — | — | — |
