[go: up one dir, main page]

0% found this document useful (0 votes)
32 views4 pages

Toc A

This document outlines a course plan for Theory of Computation. It covers 5 units: 1) Finite Automata and Regular Languages, 2) Regular Expressions, 3) Context-Free Grammars, 4) Pushdown Automata, and 5) Turing Machines. Each unit covers key concepts through lectures using methods like chalk-talk-discussion. Assessment includes in-semester and end-semester exams testing comprehension of concepts mapped to specific course outcomes. Dates are planned for completing each topic to cover the entire course plan over one semester.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
32 views4 pages

Toc A

This document outlines a course plan for Theory of Computation. It covers 5 units: 1) Finite Automata and Regular Languages, 2) Regular Expressions, 3) Context-Free Grammars, 4) Pushdown Automata, and 5) Turing Machines. Each unit covers key concepts through lectures using methods like chalk-talk-discussion. Assessment includes in-semester and end-semester exams testing comprehension of concepts mapped to specific course outcomes. Dates are planned for completing each topic to cover the entire course plan over one semester.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Sandip Foundation's

Sandip Institute of Technology and Research Centre, Nashik


Department of Computer Engineering
===============================================
=
Brief
Course Plan: Theory of Computation(310242)
Class: T. E. Division: A Semester: I Academic Year: 2022-23

Teaching Scheme: 03 Hours/Week (TH) | Credit: 03 | Examination Scheme: In-Semester (TH): 30 Marks | End-Semester (TH): 70 Marks

CO Conduction
Teaching Planned
Sr. No. Unit Lecture Content Mapp Date Remark
Method Date
ing
Finite Automata (FA): An informal picture of Chalk, Talk,
1.1 FA, Finite State Machine (FSM). Discussion
CO1 18/07/22

Language accepted by FA. Chalk, Talk,


1.2 Discussion
CO1 20/07/22

Definition of Regular Language. Chalk, Talk,


1.3 CO1 21/07/22
Discussion
Unit I

Chalk, Talk,
Deterministic and Nondeterministic FA (DFA Discussion
1.4 CO1 25/07/22
and NFA).
Epsilon- NFA and inter-conversion.Chalk, Talk, Chalk, Talk,
1.5 Discussion CO1 27/07/22
Discussion
1.6 Chalk, Talk,
Minimization of DFAs. Discussion CO1 28/07/22

Moore and Mealy machines -Definition, Chalk, Talk,


1.7 Discussion, Q & A
CO1 01/08/22
models, inter-conversion.
Chalk, Talk, CO2
Introduction, Operators of RE, Precedence of Discussion, Q & A
2.1 03/08/22
operators.
Chalk, Talk, CO2
Algebraic laws for RE, Language to Regular Discussion, Q & A
2.2 04/08/22
Expressions.

Brain Storming CO2


2.3 Equivalence of two REs. 08/08/22

RE to NFA, DFA, DFA to RE using Arden’s


Chalk, Talk, CO2
Unit II

2.4 Discussion, Q & A 10/08/22


theorem.
Chalk, Talk, CO2
2.5 Pumping Lemma for Regular languages. Discussion, Q & A 11/08/22

Closure and Decision properties of Regular


Chalk, Talk, CO2
2.6 Discussion, Q & A 17/08/22
languages.
Chalk, Talk, CO2
Discussion, Q & A
2.7 Myhill-Nerode theorem. 18/08/22

Chalk, Talk, CO3


Basic Elements of Grammar, Formal Discussion, Q & A
3.1 Definition of Context Free Grammar, 22/08/22
Sentential form.
Chalk, Talk, CO3
Discussion, Q & A
Unit III

3.2 Derivation and Derivation Tree/ Parse Tree. 24/08/22

Context Free Language (CFL), Ambiguous Chalk, Talk, CO3


3.3 Grammar, Discussion, Q & A 25/08/22
writing grammar for language.
3.4 Eliminating Є-productions, unit productions, Chalk, Talk, CO3 29/08/22
useless production, useless symbols. Discussion, Q & A
Chomsky Normal Form, Greibach Normal Chalk, Talk, CO3
3.5 Form, Pumping Lemma for CFG, Closure Discussion 01/09/22
properties of CFL.
Decision properties of CFL, Chomsky Chalk, Talk, CO3
3.6 Discussion, Q & A 05/09/22
Hierarchy, Cock-Younger-Kasami Algorithm.
Chalk, Talk, CO4
Discussion, Q & A
4.1 Introduction, Formal definition of PDA. 07/09/22

Chalk, Talk, CO4


4.2 Equivalence of Acceptance by Final State. Discussion, Q & A 12/09/22

Chalk, Talk, CO4


Discussion, Q & A
4.3 Equivalence of Acceptance by Empty stack. 14/09/22
Unit IV

Chalk, Talk, CO4


Discussion, Q & A
4.4 Non-deterministic PDA (NPDA). 15/09/22

Chalk, Talk, CO4


Discussion, Q & A
4.5 PDA and Context Free Language. 19/09/22

Chalk, Talk, CO4


4.6 Equivalence of PDA and CFG, PDA vs CFLs. Discussion, Q & A 21/09/22

Chalk, Talk, CO4


4.7 Deterministic CFLs. Discussion, Q & A 22/09/22

Chalk, Talk,
Turing Machine Model, Formal definition of Discussion, Q & A CO5
5.1 Turing Machines, Language Acceptability by 26/09/22
Unit V

Turing Machines.
Design of TM, Description of TM, Techniques Chalk, Talk, CO5
5.2 Discussion, Q & A 28/09/22
for TM Construction.
Chalk, Talk, CO5
Computing function with Turing Discussion, Q & A
5.3 29/09/22
Machine,Variants of Turing Machines.

Chalk, Talk, CO5


5.4 Halting Problem of TM, Halting vs Looping. Discussion, Q & A 06/10/22

Chalk, Talk,
A Turing-unrecognizable language, Discussion, Q & A CO5
5.5 10/10/22
Reducibility, Recursion Theorem.
Chalk, Talk, CO6
6.1 The Model of Linear Bounded Automata. Discussion, Q & A 12/10/22

Chalk, Talk, CO6


Decidable Problems and Un-decidable Discussion, Q&A
6.2 17/10/22
Problems, Church-Turing Thesis.

Undecidable Problems that is recursively Chalk, Talk, CO6


6.3 Discussion, Q & A 19/10/22
enumerable, A Simple Un-decidable.
Chalk, Talk, CO6
Unit VI

Time and Space Measures, The Class P, Discussion, Q & A


6.4 20/10/22
Examples of problems in P.
Chalk, Talk, CO6
6.5 The Class NP, Examples of problems in NP. Discussion, Q & A 31/10/22

Chalk, Talk, CO6


6.6 P Problem Versus NP Problem. Discussion 2/11/22

Chalk, Talk, CO6


6.7 NP-completeness,Hard Problems. Discussion, Q & A 03/11/22

Prof. Pramod G. Patil Dr. Amol D. Potgantwar


Subject In-charge Head (Computer Engineering)

You might also like