Theory of Computation (COM-503)
Program: B.Tech Computer Science and Engineering (Artificial Intelligence and Machine Learning)
Category: Professional Core Course
Semester: 5
Credits: 4
L-T-P: 3- 1- 0
Description
Instructor

Mr. Anil Gupta

Assistant Professor
Department Of Computer Science & Engineering
Course Outcomes
  • Apply DFA and NFA concepts to design and analyze finite automata.
  • Analyze context-free grammars and the Pumping Lemma for language properties.
  • Design computational models using various Turing machine models.
  • Evaluate Push Down Automata models for their acceptance criteria of context-free languages.
  • Assess properties of recursive and recursively enumerable languages for decidability issues.
Resources
Course Handout Lesson Plan Syllabus
Evaluation Scheme
MST 10
MST_1 10
Assignment 20
Attendance 10
Total Internal 50
Total External 100
Overall Total 150