Syllabus

Regular languages and finite automata, Context free languages and Push-down automata; Recursively enumerable sets and Turing machines, Undecidability.

Analysis of Previous GATE Papers

Exam Year 94 95 96 97 98 99 00 01 02 03
1 Mark Questions 1 1 3 1 5 3 2 3 1 3
2 Mark Questions 4 2 2 3 3 1 1 2 6 6
Total Marks 14 5 7 7 11 5 4 7 18 15

 

Exam Year 04 05 06 07 08 09 10 11 12 13
1 Mark Questions 1 2 2 3 4 1 3 4 2
2 Mark Questions 4 7 5 5 5 3 3 3 1 3
Total Marks 9 14 12 12 13 11 7 9 6 8

 

Exam Year 2014
Set Set-1 Set-2 Set-3
1 Mark Questions 2 2 2
2 Mark Questions 2 2 2
Total Marks 6 6 6