Printed on 1/21/2025 12:24:17 PM

LECTURE PLAN

Institute/Department UNIVERSITY INSTITUTE Program Bachelor of Engineering + Master

OF ENGINEERING (UIE) of Engineering (Computer
Science and Engineering)
(Integrated)(BI519)
Master Subject Coordinator Monika Master Subject Coordinator E- E9911
Name: Code:
Course Name Theory of Computation Course Code 22CST-353

Lecture Tutorial Practical Self Study Credit Subject Type

3 0 0 0 3.00 T

Course Type Course Category Mode of Assessment Mode of Delivery

N.A Graded (GR) Theory Examination (ET) Theory (TH)

Mission of the M1: To provide practical knowledge using state-of-the-art technological support for the experiential learning of our students.
Department M2: To provide industry recommended curriculum and transparent assessment for quality learning experiences.
M3: To create global linkages for interdisciplinary collaborative learning and research.
M4: To nurture advanced learning platform for research and innovation for students ‘profound future growth.
M5: 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 Engage in successful careers in industry, academia, and public service, by applying the acquired knowledge of Science,
Mathematics and Engineering, providing technical leadership for their business, profession and community.
PEO2 Establish themselves as entrepreneur, work in research and development organization and pursue higher education

PEO3 Exhibit commitment and engage in lifelong learning for enhancing their professional and personal capabilities.

Program Specific OutComes(PSOs)

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

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

Program OutComes(POs)
PO1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals and an engineering
specialization to the solution of complex engineering problems.
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 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 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 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 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.
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.

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

 Printed on 1/21/2025 12:24:17 PM
LECTURE PLAN

PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice.

PO9 Individual or teamwork: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary
settings.
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 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 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. 4th Edition Tata McGraw-Hill 2003
Theory of Computation Publishing
Company Limited
2 Theory of Computer Science KLP Mishra 3rd Edition Chaukhamba 2008
Auriyantaliya

Reference Books
Sr No Title of the Book Author Name Volume/Edition Publish Hours Years
1 Theory Of Computation Sipser 1st edition Cengage Learning 2013

2 ntroduction to computer Theory Daniel I.A. Cohen 2nd John Wiley & sons 1986

Course OutCome
SrNo OutCome
CO1 Understand the concept of formal languages , grammars and basic machines.
CO2 Apply alphabets and formal languages learnt in the formation of DFA and NFA.
CO3 Analyze the properties of Regular sets using pumping lemma and theorems with their closure properties.
CO4 Design Context Free Grammar and Normal Forms such as Chomsky Normal Form (CNF) & Griebach
Normal Form (GNF)
CO5 Create various automata machines with respect to languages such as PDA, Turing machines

Lecture Plan Preview-Theory

Mapped with
Pedagogical
Unit No LectureNo ChapterName Topic Text/ Reference Books CO Numer
Tool**
(s)
1 1 INTRODUCTIO Introduction to Automata Theory with ,T-Introduction to Languages and PPT CO1
N the help of Day-1 PPT ,T-Theory of Computer Science,R-
Theory Of Computation
1 2 INTRODUCTIO Basic Terminology: Alphabet, String, ,T-Introduction to Languages and Infographics, CO1
N Languages & Grammar ,R-Theory Of Computation PPT
1 3 INTRODUCTIO Operations on languages ,T-Introduction to Languages and Instructor CO1
N ,R-Theory Of Computation Lead
WorkShop,P
PT
1 4 INTRODUCTIO Chomsky classification of Languages ,T-Introduction to Languages and Infographics, CO1
N ,R-Theory Of Computation PPT
1 5 Finite automata Definition of Automata, Finite Automata, ,T-Theory of Computer Science,R- Infographics, CO2
NFA ntroduction to computer Theory PPT
1 6 Finite automata Acceptability of a string by Finite ,T-Theory of Computer Science,R- Infographics, CO2
Automata and Numerical Practice ntroduction to computer Theory PPT

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

 Printed on 1/21/2025 12:24:17 PM
LECTURE PLAN

1 7 Finite automata Deterministic Finite Automata(DFA), ,T-Introduction to Languages and Infographics, CO2
Non-Deterministic Finite Automata ,R-ntroduction to computer Theory PPT
(NFA)
1 8 Finite automata Equivalence of DFA and NDF and ,T-Introduction to Languages and Infographics, CO2
Related Numerical Practice ,T-Theory of Computer Science,R- PPT,Video
Theory Of Computation Lecture
1 9 Finite automata NFA with and without null and ,T-Introduction to Languages and Infographics, CO2
Conversion of NFA with null to NFA ,T-Theory of Computer Science,R- PPT,Video
without null Theory Of Computation Lecture
1 10 FINITE Finite Automata with output ,T-Theory of Computer Science,R- Case CO2
AUTOMATA ntroduction to computer Theory Study,PPT
WITH OUTPUT
1 11 FINITE Moore and Mealy Machines ,T-Introduction to Languages and Case CO2
AUTOMATA ,T-Theory of Computer Science,R- Study,PPT,V
WITH OUTPUT Theory Of Computation ideo Lecture
1 12 FINITE Equivalence of Moore and Mealy ,T-Theory of Computer Science,R- Infographics, CO2
AUTOMATA Machines ntroduction to computer Theory PPT,Video
WITH OUTPUT Lecture
1 13 FINITE Numerical practice of Moore and Mealy ,T-Introduction to Languages and Infographics, CO2
AUTOMATA Machines ,R-ntroduction to computer Theory PPT,Video
WITH OUTPUT Lecture
1 14 FINITE Minimization of Finite Automata and ,T-Introduction to Languages and PPT,Simulati CO2
AUTOMATA related Numerical practice ,R-Theory Of Computation on,Video
WITH OUTPUT Lecture
1 15 Finite automata Revision/Surprise Test of Unit-1 ,T-Introduction to Languages and Infographics, CO2
,R-Theory Of Computation PPT,Simulati
on,Video
Lecture
2 16 PROPERTIES Regular Languages, Closure Properties ,T-Introduction to Languages and PPT,Video CO3
OF REGULAR of Regular Sets ,T-Theory of Computer Science,R- Lecture
SETS Theory Of Computation
2 17 PROPERTIES The Pumping Lemma for Regular sets, ,T-Introduction to Languages and PPT,Video CO3
OF REGULAR Application of Pumping Lemma ,R-Theory Of Computation Lecture
SETS
2 18 PROPERTIES Pumping Lemma practice questions ,T-Introduction to Languages and Case CO3
OF REGULAR ,R-ntroduction to computer Theory Study,PPT,V
SETS ideo Lecture
2 19 REGULAR Construction of Finite Automata ,T-Introduction to Languages and Infographics, CO3
EXPRESSION equivalent to Regular Expression ,R-Theory Of Computation PPT,Video
S Lecture
2 20 REGULAR Equivalence of two Finite Automata & ,T-Introduction to Languages and PPT,Simulati CO2
EXPRESSION Numerical problems ,R-Theory Of Computation on,Video
S Lecture
2 21 REGULAR Algebraic method using Arden’s ,T-Introduction to Languages and PPT,Simulati CO3
EXPRESSION theorem to solve Regular Expression ,R-Theory Of Computation on,Video
S Lecture
2 22 REGULAR Numerical problems of Arden's method ,T-Introduction to Languages and PPT,Simulati CO3
EXPRESSION ,R-Theory Of Computation on,Video
S Lecture
2 23 CONTEXT Definition, Derivation trees and ,T-Introduction to Languages and Infographics, CO4
FREE ambiguity ,T-Theory of Computer Science,R- PPT,Simulati
GRAMMERS ntroduction to computer Theory on
2 24 CONTEXT Simplification of Context free grammar: ,T-Introduction to Languages and PPT,Video CO4
FREE Construction of Reduced grammar ,T-Theory of Computer Science,R- Lecture
GRAMMERS Theory Of Computation
2 25 CONTEXT Removal of useless symbols , Removal ,T-Introduction to Languages and PPT,Simulati CO4
FREE of ?-moves and unit productions ,T-Theory of Computer Science,R- on,Video
GRAMMERS Theory Of Computation Lecture
2 26 CONTEXT Normal forms: Chomsky Normal Form ,T-Introduction to Languages and PPT,Simulati CO4
FREE (CNF), Griebach Normal Form (GNF) ,T-Theory of Computer Science,R- on,Video
GRAMMERS Theory Of Computation Lecture

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

 Printed on 1/21/2025 12:24:17 PM
LECTURE PLAN

2 27 CONTEXT Conversions in CNF and related ,T-Introduction to Languages and PPT,Video CO4
FREE numerical ,T-Theory of Computer Science,R- Lecture
GRAMMERS Theory Of Computation
2 28 CONTEXT CNF to GNF conversion & related ,T-Introduction to Languages and PPT,Simulati CO4
FREE questions ,R-ntroduction to computer Theory on,Video
GRAMMERS Lecture
2 29 CONTEXT Practice questions of Unit-2 ,T-Introduction to Languages and PPT,Video CO4
FREE ,R-ntroduction to computer Theory Lecture
GRAMMERS
2 30 CONTEXT Revision/Surprise Test of Unit-2 ,T-Introduction to Languages and Video CO4
FREE ,R-Theory Of Computation Lecture
GRAMMERS
3 31 CONTEXT Context sensitive Language and ,T-Introduction to Languages and PPT,Video CO1
SENSITIVE grammar ,R-ntroduction to computer Theory Lecture
LANGUAGE
3 32 CONTEXT Relation between languages of classes ,T-Introduction to Languages and PPT,Video CO1
SENSITIVE ,R-Theory Of Computation Lecture
LANGUAGE
3 33 PUSHDOWN Definition, Acceptance by PDA ,T-Introduction to Languages and PPT,Video CO5
AUTOMATA ,T-Theory of Computer Science,R- Lecture
Theory Of Computation
3 34 PUSHDOWN PDA & CFG ,T-Introduction to Languages and PPT,Video CO5
AUTOMATA ,T-Theory of Computer Science,R- Lecture
Theory Of Computation
3 35 PUSHDOWN Applications of Push Down Automata. ,T-Introduction to Languages and PPT,Video CO5
AUTOMATA ,R-Theory Of Computation Lecture
3 36 PUSHDOWN Practice questions to design PDA ,T-Introduction to Languages and PPT,Video CO5
AUTOMATA ,R-Theory Of Computation Lecture
3 37 TURING Definitions and Representation ,T-Introduction to Languages and PPT,Video CO5
MACHINES ,R-ntroduction to computer Theory Lecture
3 38 TURING Language acceptability by TM ,T-Introduction to Languages and PPT,Video CO5
MACHINES ,R-Theory Of Computation Lecture
3 39 TURING Linear Bounded Automata, Variants of ,T-Introduction to Languages and PPT,Video CO5
MACHINES Turing Machine ,R-Theory Of Computation Lecture

3 40 TURING Deterministic and Non- Deterministic ,T-Introduction to Languages and PPT,Video CO5
MACHINES Turing Machines, Multi tape Turing ,R-Theory Of Computation Lecture
Machine.

3 41 DECIDABILITY Decidable & Undecidable languages ,T-Introduction to Languages and PPT,Video CO5
& RELATED ,R-Theory Of Computation Lecture
PROBLEMS
3 42 DECIDABILITY PCP and MPCP Problem ,T-Theory of Computer Science,R- PPT,Video CO5
& RELATED Theory Of Computation Lecture
PROBLEMS
3 43 DECIDABILITY Halting Problem ,T-Theory of Computer Science,R- PPT,Video CO5
& RELATED Theory Of Computation Lecture
PROBLEMS
3 44 DECIDABILITY Recursively Enumerable and Recursive ,T-Introduction to Languages and PPT,Video CO5
& RELATED Languages ,R-ntroduction to computer Theory Lecture
PROBLEMS
3 45 DECIDABILITY Revision/Surprise Test Unit-3 ,T-Theory of Computer Science,R- PPT,Video CO5
& RELATED Theory Of Computation Lecture
PROBLEMS

Assessment Model
Sr No Assessment Name Exam Name Max Marks
1 20EU01 External Theory 60
2 20EU01 Assignment/PBL 10

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

 Printed on 1/21/2025 12:24:17 PM
LECTURE PLAN

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 2 3 NA NA 2 2 NA NA NA NA NA NA 2 NA

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

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

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

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

Target 2.4 2.6 3 3 2.6 2.25 NA 2 NA NA 2.25 2 2.4 NA

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

 Printed on 1/21/2025 12:24:17 PM
LECTURE PLAN

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