Printed on 2/8/2023 8:56:15 PM

LECTURE PLAN

Institute/Department UNIVERSITY INSTITUTE Program Bachelor of Engineering -

OF ENGINEERING (UIE) Computer Science & Engineering
(CS201)
Master Subject Coordinator Priyanka Sharma Master Subject Coordinator E- E6197
Name: Code:
Course Name Theory of Computation Course Code 20CST-353

Lecture Tutorial Practical Self Study Credit Subject Type

3 0 0 0 3.0 T

Course Type Course Category Mode of Assessment Mode of Delivery

Program Core Graded (GR) Theory Examination (ET) Theory (TH)

Mission of the MD1: To provide practical knowledge using state-of-the-art technological support for the experiential learning of our students.
Department MD2: To provide an industry-recommended curriculum and transparent assessment for quality learning experiences.
MD3: To create global linkages for interdisciplinary collaborative learning and research.
MD4: To nurture an advanced learning platform for research and innovation for students’ profound future growth.
MD5: To inculcate leadership qualities and strong ethical values through value-based education.
Vision of the “To be recognized as a leading Computer Science and Engineering department through effective teaching practices and
Department excellence in research and innovation for creating competent professionals with ethics, values, and entrepreneurial attitude to
deliver service to society and to meet the current industry standards at the global level.”

Program Educational Objectives(PEOs)

PEO1 PEO1 Graduates of the Computer Science and Engineering will contribute to the Nation’s growth through their ability to solve
diverse and complex computer science and engineering problems across a broad range of application areas. (PEO1 is focused on
Problem Solving)
PEO2 PEO2 Graduates of the Computer Science and Engineering will be successful professionals, designing and implementing
Products & Services of global standards in the field of Computer Science & Engineering, becoming entrepreneurs, Pursuing
higher studies & research. (PEO 2 is focused on Professional Success)
PEO3 PEO3 Graduates of the Computer Science and Engineering Program will be able to adapt to changing scenario of dynamic
technology with an ability to solve larger societal problems using logical and flexible approach in decision making. (PEO 3 is
focused on Attaining Flexibility and Adaptability)

Program Specific OutComes(PSOs)

PSO1 PSO1 Exhibit attitude for continuous learning and deliver efficient solutions for emerging challenges in the computation domain.

PSO2 PSO2 Apply standard software engineering principles to develop viable solutions for Information Technology Enabled Services
(ITES).

Program OutComes(POs)
PO1 PO1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals and an engineering
specialization to the solution of complex engineering problems.
PO2 PO2 Problem analysis: Identify, formulate, review research literature and analyze complex engineering problems reaching
substantiated conclusions using first principles of mathematics, natural sciences and engineering sciences.
PO3 PO3 Design/development of solutions: Design solutions for complex engineering problems and design system components or
processes that meet the specified needs with appropriate consideration for the public health and safety and the cultural, societal,
and environmental considerations.
PO4 PO4 Conduct investigations of complex problems: Use research-based knowledge and research methods including design of
experiments, analysis and interpretation of data and synthesis of the information to provide valid conclusions.
PO5 PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources and modern engineering and IT tools
including prediction and modeling to complex engineering activities with an understanding of the limitations.
PO6 PO6 The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and
cultural issues and the consequent responsibilities relevant to the professional engineering practice.

University Information System - By - ERP Division Page 1 of 6

 Printed on 2/8/2023 8:56:15 PM
LECTURE PLAN

PO7 PO7 Environment and sustainability: Understand the impact of the professional engineering solutions in societal and
environmental contexts, and demonstrate the knowledge of, and need for sustainable development
PO8 PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice.

PO9 PO9 Individual or teamwork: Function effectively as an individual, and as a member or leader in diverse teams, and in
multidisciplinary settings.
PO10 PO10 Communication: Communicate effectively on complex engineering activities with the engineering community and with
society at large, such as, being able to comprehend and write effective reports and design documentation, make effective
presentations, and give and receive clear instructions
PO11 PO11 Project management and finance: Demonstrate knowledge and understanding of the engineering and management
principles and apply these to one’s own work, as member and leader in a team, to manage projects and in multidisciplinary
environments.
PO12 PO12 Life-long learning: Recognize the need for, and have the preparation and ability to engage in independent and life-long
learning in the broadest context to technological change.

Text Books
Sr No Title of the Book Author Name Volume/Edition Publish Hours Years
1 Introduction to Languages and Martin J.C 3rd Edition Tata McGraw-Hill -
Theory of Computation Publishing
Company Limited
2 Introduction to Automata Theory Hopcroft J.E. and Ullman J.D - Narosa -
Languages and Computation Publications

Reference Books
Sr No Title of the Book Author Name Volume/Edition Publish Hours Years
1 Theory of Computation Sipser - - -

2 Introduction to computer Theory Daniel I.A. Cohen 2nd Edition - -

Course OutCome
SrNo OutCome
CO1 Gain knowledge of formal languages and classify basic operations on them.
CO2 Illustrate Finite Automata and differentiate DFA and NFA with the help of examples
CO3 Explain and support the properties of Regular sets using pumping lemma and theorems.
CO4 Apply the knowledge of Context Free Grammar to estimate all possible patterns of strings in a given
formal language.
CO5 Implementation of Chomsky hierarchy using the concept of Turing Machine, Pushdown Automata.

Lecture Plan Preview-Theory

Mapped with
Pedagogical
Unit No LectureNo ChapterName Topic Text/ Reference Books CO Numer
Tool**
(s)
1 1 Introduction Basic introduction about subject ,T-Introduction to Automata PPT,Video CO1
Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
1 2 Introduction Basic Terminology: Alphabet, Formal ,T-Introduction to Automata PPT,Video CO1
Language Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
1 3 Introduction operations on formal languages, ,T-Introduction to Automata PPT,Video CO1
Examples of formal languages. Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation

University Information System - By - ERP Division Page 2 of 6

 Printed on 2/8/2023 8:56:15 PM
LECTURE PLAN

1 4 Finite Automata Concept of Basic Machines ,T-Introduction to Automata PPT,Video CO2

Theor,T-Introduction to Languages Lecture
and ,R-Introduction to computer
Theor,R-Theory of Computation
1 5 Finite Automata Properties and Limitations of Finite ,T-Introduction to Automata PPT,Video CO2
State Machines Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
1 6 Finite Automata Deterministic Finite Automata (DFA) ,T-Introduction to Automata PPT,Video CO2
Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
1 7 Finite Automata Non-Deterministic Finite Automata ,T-Introduction to Automata PPT,Video CO2
(NFA) Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
1 8 Finite Automata Practice questions on NFA and DFA ,T-Introduction to Automata PPT,Video CO2
Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
1 9 Finite Automata Equivalence of DFA and NDFA ,T-Introduction to Automata PPT,Video CO2
Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
1 10 Finite Automata Non-Deterministic Finite automata with ,T-Introduction to Automata PPT,Video CO2
^-Transitions. Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
1 11 Regular Introduction to Regular Languages ,T-Introduction to Automata PPT,Video CO3
expression Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
1 12 Regular Introduction to Regular Expressions ,T-Introduction to Automata PPT,Video CO3
expression Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
1 13 Regular Kleen’s Theorem ,T-Introduction to Automata PPT,Video CO3
expression Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
1 14 Regular Arden’s Method ,T-Introduction to Automata PPT,Video CO3
expression Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
1 15 Revision Unit 1 ,T-Introduction to Automata PPT,Video CO1
Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
2 16 Properties of The Pumping Lemma for Regular sets ,T-Introduction to Automata PPT,Video CO3
Regular sets Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
2 17 Properties of Application of the Pumping Lemma ,T-Introduction to Automata PPT,Video CO3
Regular sets Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
2 18 Properties of Closure Properties of Regular Sets ,T-Introduction to Automata PPT,Video CO3
Regular sets Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
2 19 Properties of Myhill- Nerode Theorem and ,T-Introduction to Automata PPT,Video CO1
Regular sets Minimization of Finite Automata Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
2 20 Properties of Minimization Algorithm ,T-Introduction to Automata PPT,Video CO1
Regular sets Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
2 21 Finite Automata Moore and Mealy Machines ,T-Introduction to Automata PPT,Video CO2
with output Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
2 22 Finite Automata Equivalence of Moore and Mealy ,T-Introduction to Automata PPT,Video CO2
with output Machines. Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
2 23 Context Free Examples and Definitions, Derivation ,T-Introduction to Automata PPT,Video CO4
Grammars trees and ambiguity Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation

University Information System - By - ERP Division Page 3 of 6

 Printed on 2/8/2023 8:56:15 PM
LECTURE PLAN

2 24 Context Free An Unambiguous CFG for Algebraic ,T-Introduction to Automata PPT,Video CO4
Grammars Expressions Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
2 25 Context Free Regular Grammar ,T-Introduction to Automata PPT,Video CO4
Grammars Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
2 26 Context Free Simplified forms and Normal forms: ,T-Introduction to Automata PPT,Video CO4
Grammars Removal of useless symbols and unit Theor,T-Introduction to Languages Lecture
production and ,R-Theory of Computation
2 27 Context Free Removal of ^-moves ,T-Introduction to Automata PPT,Video CO4
Grammars Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
2 28 Context Free Chomsky Normal Form (CNF) ,T-Introduction to Automata PPT,Video CO4
Grammars Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
2 29 Context Free Griebach Normal Form (GNF) ,T-Introduction to Automata PPT,Video CO4
Grammars Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
2 30 Revision Unit 2 ,T-Introduction to Automata PPT,Video CO4
Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
3 31 Context Context sensitive Language and ,T-Introduction to Automata PPT,Video CO1
sensitive grammar Theor,T-Introduction to Languages Lecture
Language and ,R-Theory of Computation
3 32 Context Relation between languages of classes ,T-Introduction to Automata PPT,Video CO1
sensitive Theor,T-Introduction to Languages Lecture
Language and ,R-Theory of Computation
3 33 Pushdown Introduction and Definition of Push- ,T-Introduction to Automata PPT,Video CO5
Automata Down Automaton Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
3 34 Pushdown Applications of Push Down Automata ,T-Introduction to Automata PPT,Video CO5
Automata Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
3 35 Turing Definitions and Examples ,T-Introduction to Automata PPT,Video CO5
Machines Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
3 36 Turing Deterministic and Non- Deterministic ,T-Introduction to Automata PPT,Video CO5
Machines Turing Machines Theor,T-Introduction to Languages Lecture
and ,R-Introduction to computer
Theor,R-Theory of Computation
3 37 Turing Unsolvable Problems: A Non recursive ,T-Introduction to Automata PPT,Video CO1
Machines Language and an Unsolvable Problem Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
3 38 Turing PCP Problem and MPCP Problem ,T-Introduction to Automata PPT,Video CO1
Machines Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation
3 39 More General Recursively Enumerable ,T-Introduction to Automata PPT,Video CO1
Languages and Theor,T-Introduction to Languages Lecture
Grammars and ,R-Theory of Computation
3 40 More General Recursive Languages ,T-Introduction to Automata PPT,Video CO1
Languages and Theor,T-Introduction to Languages Lecture
Grammars and ,R-Theory of Computation
3 41 More General Unrestricted grammars ,T-Introduction to Automata PPT,Video CO1
Languages and Theor,T-Introduction to Languages Lecture
Grammars and ,R-Theory of Computation
3 42 More General Chomsky hierarchies of grammars ,T-Introduction to Automata PPT,Video CO5
Languages and introduction Theor,T-Introduction to Languages Lecture
Grammars and ,R-Theory of Computation
3 43 More General Type 0 and 2 ,T-Introduction to Automata PPT,Video CO5
Languages and Theor,T-Introduction to Languages Lecture
Grammars and ,R-Theory of Computation

University Information System - By - ERP Division Page 4 of 6

 Printed on 2/8/2023 8:56:15 PM
LECTURE PLAN

3 44 More General Type 1 and 3 ,T-Introduction to Automata PPT,Video CO1

Languages and Theor,T-Introduction to Languages Lecture
Grammars and ,R-Theory of Computation
3 45 Revision Unit 3 ,T-Introduction to Automata PPT,Video CO5
Theor,T-Introduction to Languages Lecture
and ,R-Theory of Computation

Assessment Model
Sr No Assessment Name Exam Name Max Marks
1 20EU01 External Theory 60
2 20EU01 Assignment 10
3 20EU01 Attendance Marks 2
4 20EU01 Mid-Semester Test-1 20
5 20EU01 Quiz 4
6 20EU01 Surprise Test 12
7 20EU01 Mid-Semester Test-2 20

CO vs PO/PSO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 NA NA 1 NA NA NA NA NA NA NA 1 NA

CO2 3 2 NA 1 NA NA NA NA NA NA NA NA 1 NA

CO3 3 2 NA 1 NA NA NA NA NA NA NA NA 1 NA

CO4 3 2 1 2 NA NA NA NA NA NA NA NA 1 NA

CO5 3 2 3 1 1 NA NA NA NA NA NA NA 2 NA

Target 3 2 2 1.25 1 NA NA NA NA NA NA NA 1.2 NA

University Information System - By - ERP Division Page 5 of 6

 Printed on 2/8/2023 8:56:15 PM
LECTURE PLAN

University Information System - By - ERP Division Page 6 of 6