| Year/Subject | Theory of Computation | ||
| Easy | Medium | Difficult | |
| 2015 MARCH-CS Scientist-C | 1.Context free language 2.MIs(2) 3.RE 4.FSM | — | — |
| 2016 MARCH-CS/IT/EC-STA | 1.Regular sets 2.NFA | — | — |
| 2016 MARCH-CS/IT-Scientist-B | 1.RE 2.CFG | 1.Properties 2.Finite Automata(2) 3.CFG(2) 4.Recursive Function | — |
| 2016 DEC-IT-Scientist-B | — | — | — |
| 2016 DEC-CS-Scientist-B | 1.FSM 2.CFG 3.TM 4.SDT | 1.DFA 2.RE | — |
| 2017 JULY-IT-Scientist-B | — | — | — |
| 2017 JULY-CS-Scientist-B | 1.NFA | 1.Regular expression 2.Recursive enumerable | — |
| 2017 OCT-CS-SA | 1.TM 2.Pumping lemma 3.Mis | 1.CFG | 1.CFG |
| 2017 OCT-IT-SA | — | 1.CFG | — |
| 2017 DEC-CS/IT-STA | 1.NFA 2.DFA(2) 3.Concatenation operation 4.Mealy/moore machine 5.Closure properties(2) 6.Finite automata(2) 7.Regular Expression 8.DFA & NFA | 1.Regular expression | — |
| 2017 DEC-CS/IT-Scientist-B | 1.Regular Expression 2.Recursive enumerable language 3.Turing machine(2) 4.Mealy/moore machine 5.DCFG(closure properties) 6.Deterministic & Non deterministic | 1.Regular expression(5) 2.CFG(2) 3.Lexicographical order 4.CYK algorithm 5.Mis | 1.Undecidability 2.Binary operation |
| 2018 DEC-CS/IT-STA | 1.TM 2.Closure properties(2) 3.PDA 4.Non regular language | — | — |
| 2018 DEC-CS/IT-Scientist-B | 1.Regular language 2.Regular expression 3.Regular grammar 4.CFG 5.Closure properties 6.CFG | — | — |
