FATIMA MICHAEL COLLEGE OF ENGINEERING & TECHNOLOGY

Madurai – 625020

LESSON PLAN

Academic Year: 2023-2024 Semester: 04 Department: BE – CSE

Sub. Code and Name: CS3452 Theory of Computation Staff Name: Dr. P. Ravikumaran HOD/CSE

Teachi Assessment Planned

S. Objectives
SYLLABUS TOPICS PP Out comes ng
No.
Aids
AUTOMATA AND REGULAR EXPRESSIONS
L1 Need for automata theory 1. Apply knowledge to 7-9 1. Able to design G form Diagnostic Test
L2 Introduction to formal proof know what Automata is? 11-18 DFA and NDFA for BB Group Activity – Numerical
and how it is used in accepting strings and Problem
L3 Finite Automata (FA) automation? 21-26 able to convert from PPT
NFA to DFA. Students Generated Questions
L4 Deterministic Finite Automata 2.To understand 26-28 PPT (Part A)
(DFA) foundations of computation 2. Able to reduce the
L5 Non-deterministic Finite Automata including automata theory 30-34 state of a DFA and PPT Analogies – Finite automata-DFA,
(NFA) also know the NFA
L6 Equivalence between NFA and DFA 3. Introduce students to 34-39 automata with output BB
the mathematical and their equivalent
Finite Automata with Epsilon foundations of machines PPT
L7 computation including 40-43
transitions
automata theory; DFA and
L8 Equivalence of NFAs with and NDFA. Video
43-46
without ε-moves-
L9 Minimization of DFAs 46-50 Video
 No. of hours allotted in syllabus: 45 Periods
No. of hours required as per plan: 45 Periods
Text Books:
1. Robert W. Sebesta, “Concepts of Programming Languages”, Twelfth Edition (Global Edition),
Pearson, 2022.
2. Michael L. Scott, “Programming Language Pragmatics”, Fourth Edition, Elsevier, 2018.
3. R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, Prentice Hall, 2011.
4. Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Pearson, 1997.
5. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”, Fifth Edition,
Springer, 2003.

STAFF IN-CHARGE HOD PRINCIPAL