Printed on 12/25/2024 10:26:00 PM

LECTURE PLAN

Institute/Department UNIVERSITY INSTITUTE Program Bachelor of Engineering + Master

OF ENGINEERING (UIE) of Engineering in Computer
Science and Engineering (Hons) -
Information Security in
association with IBM (Integrated)
(BI520)
Master Subject Coordinator Rosevir Singh Master Subject Coordinator E- E16685
Name: Code:
Course Name THEORY OF Course Code 22CST-390
COMPUTATION

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 relevant, rigorous and contemporary curriculum and aligned assessment system to ensure effective learning
Department outcomes for engineering technologies
M2: To provide platform for industry engagement aimed at providing hands-on training on advanced technological and business
skills to our students.
M3: To provide opportunities for collaborative, interdisciplinary and cutting-edge research aimed at developing solutions to real life
problems
M4: To imbibe quest for innovation, continuous learning and zeal to pursue excellence through hard work and problem-solving
approach
M5: To foster skills of leadership, management, communication, team spirit and strong professional ethics in all academic and
societal endeavours of our students

Vision of the To be recognized as a centre of excellence for Computer Science & Engineering education and research, through effective
Department teaching practices, hands-on training on cutting edge computing technologies and excellence in innovation, for creating globally
aware competent professionals with strong work ethics whom would be proficient in implementing modern technology solutions
and shall have entrepreneurial zeal to solve problems of organizations and society at large.

Program Educational Objectives(PEOs)

PEO1 To be able to explore areas of research, technology application & innovation and make a positive impact in different types of
institutional settings such as corporate entities, government bodies, NGOs, inter-government organizations, & start-ups.
PEO2 To be able to design, and implement technology and computing solutions to organizational problems, effectively deploy knowledge
of engineering principles, demonstrate critical thinking skills & make the intellectual connections between quantitative and
qualitative tools, theories, and context to solve the organizational problems
PEO3 To be able to work with, lead & engage big and small teams comprising diverse people in terms of gender, nationality, region,
language, culture & beliefs. To understand stated and unstated differences of views, beliefs & customs in diverse &
interdisciplinary team settings
PEO4 To be able to continuously learn and update one’s knowledge, engage in lifelong learning habits and acquire latest knowledge to
perform in current work settings
PEO5 To continuously strive for justice, ethics, equality, honesty, and integrity both in personal and professional pursuits. Able to
understand and conduct in a way that is responsible and respectful.

Program Specific OutComes(PSOs)

PSO1 1. The graduate student shall be able to analyze and evaluate systems with respect to maintaining operations in the presence of
risks and threats, and also communicate the human role in security systems with an emphasis on ethics, social engineering
vulnerabilities and training.
PSO2 2. The graduate student shall be able to conduct Information Security risk assessment, audit and troubleshoot Information
Security systems using Cryptographic measures learning.
PSO3 3. The graduate student shall be able to assess the Ethical Ramification of working in Information Security, information
assurance, and cyber/computer forensics software/tools.

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

 Printed on 12/25/2024 10:26:00 PM
LECTURE PLAN

Program OutComes(POs)
PO1 Apply the knowledge of mathematics, science, engineering fundamentals and an engineering specialization to the solution of
complex engineering problems.
PO2 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 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 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 Create, select, and apply appropriate techniques, resources and modern engineering and IT tools including prediction and
modelling to complex engineering activities with an understanding of the limitations.
PO6 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 Understand the impact of the professional engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.
PO8 Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice.

PO9 Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings.

PO10 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 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 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 Automata Theory, John E. Hopcroft, Rajeev 3rd Edition Pearson/Addison 2006
Languages, and Computation Motwani, Jeffrey D. Ullm Wesley

Reference Books
Sr No Title of the Book Author Name Volume/Edition Publish Hours Years
1 Computers and Intractability: A Michael R. Garey and David S. 1st Edition W.H. Freeman 1979
Guide to the Theory of NP- Johnson and Company
Completeness
2 Elements of the Theory of Harry R. Lewis and Christos H. 2nd Edition Pearson Education 1998
Computation Papadimitriou
3 Automata and Computability Dexter C. Kozen 1st Edition Springer 1997

4 Introduction to Languages and the John Martin 4th Edition McGraw Hill 2010
Theory of Computation
5 Introduction to the Theory of Michael Sipser 3rd Edition Cengage 2012
Computation Learning

Course OutCome
SrNo OutCome
CO1 Describe fundamental concepts of formal languages, grammars, and automata theory, including
alphabets, languages, grammars, and the Chomsky hierarchy.
CO2 Understand the structure and behavior of finite automata, regular languages, context-free languages,
context-sensitive languages, and Turing machines, and demonstrate their equivalences and
CO3 Apply properties, theorems (Kleene's theorem, pumping lemma, Myhill-Nerode theorem), and algorithms
for minimization, parsing, and decision problems in automata and formal language theory.

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

 Printed on 12/25/2024 10:26:00 PM
LECTURE PLAN

CO4 Analyze the computational power and limitations of different language classes and automata, including
undecidability and complexity distinctions between P, NP, and NP-complete problems.
CO5 Evaluate computational problems using reductions, and construct proofs for undecidability and
complexity, leveraging concepts such as the Church-Turing thesis, Cook’s theorem, and Rice's theorem.

Lecture Plan Preview-Theory

Mapped with
Pedagogical
Unit No LectureNo ChapterName Topic Text/ Reference Books CO Numer
Tool**
(s)
1 1 Introduction Alphabet, languages, and grammars ,T- Introduction to Automata PPT CO1
Theo,R- Elements of the Theory of
Com
1 2 Introduction Productions and derivations ,T- Introduction to Automata PPT CO1
Theo,R- Elements of the Theory of
Com,R-Automata and Computability
1 3 Introduction Chomsky hierarchy of languages ,T- Introduction to Automata PPT CO1
Theo,R- Elements of the Theory of
Com
1 4 Regular Regular expressions and formal ,T- Introduction to Automata PPT CO2
Languages and definition Theo,R- Elements of the Theory of
Finite Automata Com
1 5 Regular DFA – definition, construction, and ,T- Introduction to Automata PPT CO2
Languages and equivalence with regular expressions Theo,R- Elements of the Theory of
Finite Automata Com
1 6 Regular NFA – definition, equivalence with DFA, ,T- Introduction to Automata PPT CO2
Languages and and examples Theo,R- Elements of the Theory of
Finite Automata Com
1 7 Regular Regular grammars and their ,T- Introduction to Automata PPT CO1
Languages and equivalence with finite automata Theo,R- Elements of the Theory of
Finite Com
Automata
1 8 Regular Properties of regular languages ,T- Introduction to Automata PPT CO2
Languages and Theo,R- Elements of the Theory of
Finite Automata Com
1 9 Regular Kleene’s theorem and its proof ,T- Introduction to Automata PPT CO3
Languages and Theo,R-Introduction to the Theory of
Finite Automata
1 10 Regular Pumping lemma for regular languages ,T- Introduction to Automata PPT CO3
Languages and Theo,R-Introduction to the Theory of
Finite Automata
1 11 Regular Applications of the pumping lemma to ,T- Introduction to Automata PPT CO3
Languages and prove non-regularity Theo,R-Automata and Computability
Finite Automata
1 12 Regular Myhill-Nerode theorem and its ,T- Introduction to Automata PPT CO3
Languages and applications Theo,R-Introduction to the Theory of
Finite Automata
1 13 Regular Minimization of finite automata ,T- Introduction to Automata PPT CO3
Languages and Theo,R-Introduction to the Theory of
Finite Automata
1 14 Regular Summary of regular languages and ,T- Introduction to Automata PPT CO1
Languages and finite automata Theo,R-Introduction to the Theory of
Finite
Automata
1 15 Revision Revision Unit I ,T- Introduction to Automata Activity,PPT CO1
Theo,R-Introduction to the Theory of
2 16 Context-Free Introduction to CFG and CFL ,T- Introduction to Automata PPT CO2
Languages Theo,R-Introduction to the Theory of
2 17 Context-Free Chomsky normal form (CNF) and ,T- Introduction to Automata PPT CO2
Grammars conversion techniques Theo,R-Introduction to the Theory of
2 18 Context-Free Greibach normal form (GNF) and ,T- Introduction to Automata PPT CO2
Grammars conversion techniques Theo,R-Introduction to the Theory of

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

 Printed on 12/25/2024 10:26:00 PM
LECTURE PLAN

2 19 Pushdown Pushdown Automata ,Nondeterministic ,T- Introduction to Automata PPT CO2

Automata PDA – definition, construction, and Theo,R- Elements of the Theory of
examples Com
2 20 Pushdown Equivalence of CFG and PDA ,T- Introduction to Automata PPT CO2
Automata Theo,R-Introduction to Languages
and
2 21 Context-Free Parse trees and ambiguity in CFG ,T- Introduction to Automata PPT CO2
Grammars Theo,R-Introduction to the Theory of
2 22 Context-Free Pumping lemma for CFLs and Closure ,T- Introduction to Automata PPT CO2
Languages Properties of CFLs Theo,R-Introduction to the Theory of
2 23 Turing Basics of Turing machines (TM): ,T- Introduction to Automata PPT CO2
Machines definition, components, and Theo,R-Introduction to the Theory of
configurations
2 24 Context- Introduction to context-sensitive ,T- Introduction to Automata PPT CO2
Sensitive grammars and languages, linear Theo,R- Elements of the Theory of
Grammars bounded automata and equivalence Com
with CSG.
2 25 Context- Linear bounded automata and ,T- Introduction to Automata PPT CO3
Sensitive equivalence to CSG Theo,R- Computers and
Grammars Intractability:
2 42 Revision Revision of Unit II ,T- Introduction to Automata PPT CO3
Theo,R- Computers and
Intractability:,R-Automata and
Computability,R-Introduction to the
Theory of
3 26 Undecidability Church-Turing thesis: significance and ,T- Introduction to Automata PPT CO5
examples Theo,R-Introduction to Languages
and
3 27 Undecidability Universal Turing machine and the ,T- Introduction to Automata PPT CO4
universal language Theo,R-Introduction to Languages
and
3 28 Undecidability Diagonalization language and its ,T- Introduction to Automata PPT CO4
implications Theo,R- Computers and
Intractability:
3 29 Undecidability Reductions between languages: ,T- Introduction to Automata PPT CO4
concepts and techniques Theo,R- Computers and
Intractability:,R-Introduction to
Languages and
3 30 Undecidability Rice’s theorem: statement, proof, and ,T- Introduction to Automata PPT CO5
applications Theo,R-Introduction to Languages
and
3 31 Undecidability Examples of undecidable problems in ,T- Introduction to Automata PPT CO4
languages Theo,R- Computers and
Intractability:
3 32 Basic Introduction to time complexity: ,T- Introduction to Automata PPT CO5
Introduction to deterministic and nondeterministic TMs Theo,R- Computers and
Complexity Intractability:,R-Automata and
Computability,R-Introduction to the
Theory of
3 33 Basic Equivalence of nondeterministic and ,T- Introduction to Automata PPT CO5
Introduction to deterministic TMs Theo,R- Computers and
Complexity Intractability:,R-Introduction to
Languages and
3 34 Basic Complexity classes P and NP: ,T- Introduction to Automata PPT CO4
Introduction to definitions and examples Theo,R- Computers and
Complexity Intractability:
3 35 Basic NP-completeness: definition and ,T- Introduction to Automata PPT CO4
Introduction to significance Theo,R- Computers and
Complexity Intractability:
3 36 Basic Cook’s theorem: statement and proof ,T- Introduction to Automata PPT CO5
Introduction to outline Theo,R- Computers and
Complexity Intractability:

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

 Printed on 12/25/2024 10:26:00 PM
LECTURE PLAN

3 37 Basic Examples of NP-complete problems ,T- Introduction to Automata PPT CO5

Introduction to (e.g., SAT, Vertex Cover) and Theo,R- Computers and
Complexity reductions Intractability:
3 38 Basic Reductions to prove NP-completeness ,T- Introduction to Automata PPT CO5
Introduction to of problems Theo,R- Computers and
Complexity Intractability:
3 39 Basic Summary of undecidability theory ,T- Introduction to Automata PPT CO5
Introduction to Theo,R- Computers and
Complexity Intractability:
3 40 Basic Summary of complexity theory ,T- Introduction to Automata PPT CO5
Introduction to Theo,R- Computers and
Complexity Intractability:
3 41 Basic Problem-solving session on NP- ,T- Introduction to Automata PPT CO4
Introduction to completeness, reductions, and Theo,R-Automata and Computability
Complexity complexity theory
3 43 Basic Reduction between languages ,T- Introduction to Automata PPT CO5
Introduction to Theo,R- Computers and
Complexity Intractability:
3 44 Revision Revision Of Unit III ,T- Introduction to Automata PPT CO5
Theo,R- Computers and
Intractability:
3 45 Revision Surprise Test ,T- Introduction to Automata Activity CO5
Theo,R-Introduction to the Theory of

Assessment Model
Sr No Assessment Name Exam Name Max Marks
1 20EU01 External Theory 60
2 20EU01 Assignment/PBL 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 PSO3 PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

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

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

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

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

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

Target 1 3 3 2 3 2 NA NA NA NA NA NA NA 1 1

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

 Printed on 12/25/2024 10:26:00 PM
LECTURE PLAN

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