Theory of Computation and Complier Design (MCA-301)
Program: Master of Computer Applications
Category: Professional Core Course
Semester: 3
Credits: 4
L-T-P: 4- 0- 0
Description
In theoretical computer science, the theory of computation is the branch that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata theory, computability theory and computational complexity theory.
Instructor

Mr. Anil Gupta

Assistant Professor
Department Of Computer Science & Engineering
Course Outcomes
  • Apply algorithmic principles and computer science theory to the modeling and design of computational systems.
  • Demonstrate knowledge of basic mathematical models of computation and relate them to formal languages.
  • Understand the limitations of computers and know about unsolvable problems.
  • Understand different phases, intermediate representations, algorithms and principles of working of a compiler
  • Apply parsing techniques, error handling and various issues in compiler design for optimized performance.
Resources
Course Handout Lesson Plan Syllabus
Evaluation Scheme
MST 20
Assignment 10
Attendance 10
Total Internal 40
Total External 60
Overall Total 100