Theory of Computation (2160704)   Old Code : 160704

3
Credit
3 + 0 + 0
Lect + Tuto + Pract
Teaching Scheme
70 + 20 + 10
ESE + PA + ALA
Theory Marks
0 + 0 + 0
ESE + OEP + PA
Practical Marks
ESE - End Semester Examination, PA - Progress Assessment, ALA - Active Learning Assignments, OEP -Open Ended Problem


Prerequisite
Calculus, Data Structures and Algorithms
Rationale
Theory of computation teaches how efficiently problems can be solved on a model of computation, using an algorithm. It is also necessary to learn the ways in which computer can be made to think. Finite state machines can help in natural language processing which is an emerging area.
Course Outcome
After learning the course the students should be able to:
1. At the end of the course the students will be able to understand the basic concepts and application of Theory of Computation.
2. Students will apply this basic knowledge of Theory of Computation in the computer field to solve computational problems and in the field of compiler also.

Active Learning
Preparation of power-point slides, which include videos, animations, pictures, graphics for better understanding theory and practical work – The faculty will allocate chapters/ parts of chapters to groups of students so that the entire syllabus to be covered. The power-point slides should be put up on the web-site of the College/ Institute, along with the names of the students of the group, the name of the faculty, Department and College on the first slide. The best three works should submit to GTU.