Professional Documents
Culture Documents
GATE INSTRUCTORS
Institute for GATE & PSUs
Contents
S.NO. Topic Page No.
1 Theory 1 - 18
1.1 Set-1 60 - 73
1.2 Set-2 74 - 87
Theory of Computation
Syllabus
Theory of Computation: Regular languages and finite automata, Context free languages and
Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.
16
14
12
10
0
2002 2004 2006 2008 2010 2012 2014
Important Topics
Most Important Regular languages and finite automata
Important Context free languages and Push-down automata
Thecry of Computer 5e ience
Answers & Explanations Praetice Set: ! t Basic il-evel
10. (b) 26. (d) 42" (a) 58. (b) 74. (b)
11. (c) 27" (a) 43. (a) 59" (d) 75" (b)
12. (c) 28. (a) 44. (d) 60. (c) 76. (rr)
13. (a) 29" (d) 45. (c) 61" (a) 77. (a)
14. (d) 30" (d) 46. (a) 62. (b) 78. (d)