ASET-CS/AC08/FM01
Course Information Sheet & Hour Wise Lesson Plan
Department of Computer Science and Engineering
Name of the Faculty:Ms. Designation: Assistant Department : CSE
Silpa Sivadas Professor
Student Batch: 2022-2026 Academic Year: 2024-25 Semester: S5
Subject Code & Name: YEAR OF
CATEGOR T
CST 305 SYSTEM L P CREDIT INTRODUCTIO
Y N
SOFTWARE
PCC 3 1 0 4 2019
Preamble:
The purpose of this course is to create awareness about the low-level codes which are very
close to the hardware and about the hardware and about the environment where programs can
be developed and executed. This course helps the learner to understand the machine
dependent and machine independent system software features and to design/implement
system software like assembler, loader, linker, microprocessor and device drivers. Study of
system software develops ability to design interfaces between software applications and
computer hardware.
To make students understand the design concepts of various system software like
Assembler, Linker, Loader and Macro pre-processor, Utility Programs such as
Text Editor and Debugger.
Prerequisite:
The purpose of this course is to create awareness about the low-level codes which are very
close to the hardware and about the hardware and about the environment where programs can
be developed and executed. This course helps the learner to understand the machine
dependent and machine independent system software features and to design/implement
system software like assembler, loader, linker, microprocessor and device drivers. Study of
system software develops ability to design interfaces between software applications and
computer hardware.
Basic knowledge about the following topic is assumed: sets, relations - equivalence relations,
functions, proof by Principle of Mathematical Induction.
Course Outcomes
CST301 Classify a given formal language into Regular, Context-Free, Context Sensitive,
CO1 Recursive or Recursively Enumerable. [Cognitive knowledge level: Understand]
CST301 Explain a formal representation of a given regular language as a finite state automaton,
CO2 regular grammar, regular expression and Myhill-Nerode relation. [Cognitive
knowledge level: Understand]
CST301 Design a Pushdown Automaton and a Context-Free Grammar for a given context-free
CO3 language. [Cognitive knowledge level : Apply]
CST301 Design Linear Bounded Automaton, Context Sensitive Grammar for a given Context
CO4 Sensitive language, Turing machines as language acceptors or transducers. [Cognitive
knowledge level: Apply]
CST301
CO5 Explain the notion of decidability. [Cognitive knowledge level: Understand]
Proposed Mapping of course outcomes with program outcomes
Program Outcomes
COS
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
- - - - - -
CO1 3 3 3 - - 3
- - - - - -
CO2 3 3 3 3 - 3
- - - - - -
CO3 3 3 3 3 - 3
- - - - - -
CO4 3 3 3 3 - 3
- - - - - -
CO5 3 3 3 3 - 3
1 : Low 2 : Moderate 3 : High
Abstract POs defined by National Board of Accreditation
PO# Broad PO PO# Broad PO
PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and team work
PO4 Conduct investigations of complex PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Life long learning
Proposed mapping of course outcomes with Program Specific Outcomes
Program Specific Outcomes
CO’s
PSO-1 PSO-2 PSO-3
2 1 1
CST301.CO1
3 1 1
CST301.CO2
3 1
CST301.CO3 1
3 2
CST301.CO4 1
3 2
CST301.CO5 1
AVG 2.8 1.4 1
PSOs defined by department
PSO-1 Students can apply the knowledge of mathematics and skill of
computer science engineering to solve complex problems
PSO-2 Students can apply appropriate techniques, resources and latest
computing tools to solve real world problems.
PSO-3 Enable students to lead and work in a team with good communication,
project management, documentation skills and design new ideas and
innovation towards research.
Hour Wise Lesson Plan
Actual
Teaching Pedagogy Text
Sl. No. of
Module Methodolog Tool Used Book
No Portions to be Covered Lecture Date(s) of
No. y (P1 / P2 / &
. Hours Coverage
(L /A/S/T) P3 / P4) Refer
ences
1 1 Introduction to formal 1
language theory –
Alphabets, strings,
concatenation of strings,
Languages
2 Deterministic Finite State
Automata (DFA) – 1
Example DFA
3 Formal definition of DFA,
Language accepted by the 1
class of DFA
4 Nondeterministic Finite
State Automata (NFA) – 1
Example NFA
NFA with 𝜖 transitions -
5 Formal definition of NFA,
1
examples, formal
definition
NFA with and without 𝜖
6 Equivalence of DFA and
1
transitions - Subset
construction
7 Regular Grammar (RG) –
Example RGs, derivation 1
of sentences
8 Formal definition of RG,
Language represented by a 1
RG
9 Equivalence of RG and
1
DFA
1 Regular Expression (RE) -
Example REs and formal 1
definition
with 𝜖𝜖 transition
2 Conversion of RE to NFA
1
3 Conversion of NFA with 𝜖
transition to RE (Kleen’s 1
construction)
4 Homomorphisms 1
2
5 Pumping Lemma for
1
regular languages
6 Ultimate periodicity 1
7 Closure Properties of
1
Regular Languages
8 DFA state minimization -
1
Quotient construction
9 State Minimization
1
Algorithm - Example
1 3 Myhill-Nerode Relations 1
(MNR) - Example,
Properties of
MyhillNerode Relation
2 Conversion of DFA to
1
MNR
3 Conversion of MNR to
1
DFA
4 Myhill-Nerode Theorem
1
(MNT)
5 Applications of MNT 1
6 Context Free Grammar
(CFG) - Example CFGs 1
and formal definition
7 Proving correctness of
1
CFGs
8 Derivation Trees and
1
ambiguity
9 Chomsky Normal Form 1
10 Greibach Normal Form 1
1 Nondeterministic
Pushdown Automata
1
(PDA) – Example PDAs,
formal definition
2 Acceptance criteria -
1
equivalence
3 Deterministic PDA 1
4 Conversion of CFG to
4 1
PDA
5 Conversion of PDA to
1
CGF - Part I
6 Conversion of PDA to
1
CGF - Part II
7 Pumping Lemma for
1
context-free languages
8 Closure Properties of
1
Context Free Languages
1 5 Context Sensitive
Grammar (CSG) -
1
Examples, formal
definition
2 Linear Bounded Automata
(LBA) - Example LBA, 1
formal definition
3 Turing Machine (TM) -
TM as language acceptors
1
- examples, formal
definition
4 TM as transducers -
1
examples
5 Robustness of the standard 1
TM model - Multi-tape
TMs, Nondeterministic
TM
6 Universal Turing Machine 1
7 Halting Problem of TM -
1
proof of its undecidability
8 Recursive and Recursively
1
Enumerable Languages
9 Chomsky classification of
1
formal languages
Teaching Methodology
L-Lecture, A-Assignment, S-Seminar, T-Tutorial
Pedagogy tools used:
P1 – Chalk and Board; P2 – Powerpoint Presentation; P3 – Flipped Classroom; P4 – AI tools
based teaching
Text Books
T1. Dexter C. Kozen, Automata and Computability, Springer (1999)
References
R 1. John E Hopcroft, Rajeev Motwani and Jeffrey D Ullman, Introduction to Automata
Theory, Languages, and Computation, 3/e, Pearson Education, 2007
R 2. Michael Sipser, Introduction To Theory of Computation, Cengage Publishers,
2013
Gap Identified in the syllabus
Module Gap Identified Remedial action/ Date
solution
Content beyond the Syllabus
S. No Topic Date
Remedial action/
solution
Valued added course
Project / Coding
assignments
Workshop / Seminars
Prepared by: Approved by:
Signature of Faculty Signature
Ms Anisree P G, AP CSE Dr.S.Gunasekaran, HOD/CSE
