Course file for theory of computation dt 08 08-2016.

Acropolis Technical Campus, Indore, 452020, (M.P.)
Department of Computer Science & Engineering
Course Plan
UG
Theory of Computation
Course Code CS-505 Session: July-Dec 2016 Semester: V
Tutor
1. Prof. B.K.Mishra(A,B)
2. Prof. Sumit S Jain (C)
Revision date : Branch: CSE
E mail
bkmishra.atc@acropolis.in
sumit.jain.atc@acropolis.in
Mob. No: 8889170153, 9827330833 No. of Pages: /
1. Scheme of the Semester Containing the Course
2. Course Overview
The purpose of this subject is to cover the underlying concepts and techniques used in Theory of
Computation. In this course we cover finite automata, pushdown automata, Context free
grammars and Turing machines. We also cover Pumping Lemma for Regular Language &
Context Free Language
3. Course Learning Objectives (CLO)
The Learning Objective of Theory of Computation are such that the student will
CLO1: Study various types of Finite Automata.
CLO2: Appreciate to prove equivalence of language described by Automata.
CLO3: Understand the grammar and PDA for a given language.
CLO4: Grasp the comprehensive knowledge of Turing Machine.
CLO5: Acquire awareness about the concepts of tractability, decidability, NP completeness.
CLO6: Understand the challenge for Theoretical Computer Science and its contribution.
4. Course Outcomes: (CO)
At the end of the course, student would be able to demonstrate the knowledge and
ability to
CO1: To identify different type of Finite Automata and its capability.
CO2: Analyze Regular Language and Context Free Grammar.
CO3: Illustrate Push Down Automata for a given Language and discuss itsproperties
CO4: Discuss abstract model of computing machine through Turing Machine and itstypes.
CO5: Draw to create modern techniques to solve NP completeness problems.
CO6: Recognize whether a problem is decidable or undecidable.
S.
No.
Subject
Code
Subject
Name
&
Title
Maximum Marks Allotted
Credits
Allotted
Subjectwise
Total
Credits
Remarks
Theory Slot Practical Slot
Total
Marks
Period per
week
End
Sem
Mid
SemMST
(Two
tests
avg)
Quiz,
Assignm
ent
End
Sem
Term work
L T PLab
work &
sessional
Assignme
nt / Quiz
1 CS-505
Theory of
Computation
70 20 10 0 0 0 100 3 1 0 4

Course Outcome (CO) CO Statement
CO.505.1 To identify different type of Finite Automata and its capability.
CO.505.2 Analyze Regular Language and Context Free Grammar.
CO.505.3
Illustrate Push Down Automata ( PDA) for a given Language
and discuss its properties
CO.505.4 Discuss the abstract model of computing machine through
Turing Machine and its types.
CO.505.5
Draw to create modern techniques to solve NP completeness
problems.
CO.505.6 Recognize whether a problem is decidable or undecidable.
5. Mapping Course Outcomes (COs) leading to the achievement of
Programme Outcomes (POs) and Programme Specific Outcomes (PSOs)
(Copy of programme related, PO and PSO are to be attached with this course plan)
CO
PO PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO.505.1
CO. 505.2
CO. 505.3
CO. 505.4
CO. 505.5
CO. 505.6
Enter correlation level 1, 2, 3 as defined below-
1: Slight (Low); 2: Moderate (Medium); 3: Substantial (High) and if there is no correlation, put “----“.
6. Topic delivery details of “Content beyond the Syllabus” for the attainment
of POs and PSOs.
Sr. No. Content Beyond syllabus to be taught Satisfying
PO
Satisfying
PSO
1. Discuss about the compiler
2. Natural Language Processing
3. Sentiment Analysis
4. Word Sense Disambiguation
Etc.

7. Distribution of Course Work as per University Scheme
(Copy of scheme is to be attached with this course plan)
Slot /
Contact
Type
Ingredients (per
student)
Distribution of periods @
1hr
Distribution of Marks
Max. Marks
As per University scheme
Number of
hours per week
Per Sem
(12 weeks)
End
Sem
Internal
MST / LWS Q/A
Theory
Slot
Lecture (L) 5 70 20 10
Tutorial (T) 2
Practical
Slot
Practical Work (P)
Internal Assessments are based on scheme provided by the university.
(3.a) No. of Theory Lectures Necessary for the course: 45
(3.b) No. of Theory Lectures Unit wise:
UNIT I II III IV V VI TOTAL
Assigned No. of
Lectures per Unit 
19 8 8 6 4 -- 45
Actual Taken
8. Time Schedules: Total expected periods from <Start of session> to <End of session> as per
Academic Calendar, excluding sports week, holidays etc.
<write the no. of periods available as per academic calendar >
Ingredients
Mon
day
Tues
day
Wednes
day
Thurs
day
Fri
day
Satur
day
Max.
Available
Needed Excess /
Short
Available
Theory (L)
Tutorials (T)
Practicals (P)
Batch (for T & P)
9. Prerequisite(s)
The students should have general idea about computing and mathematical concepts like Set,
Theory, Group, Function, Discrete Mathematics, Transition graph, Transition matrix.
10. Post Requisites
The students able to design and moderate automata based upon current issue. Also student
should understand how Turing Machine is solving any type of current problem or real world
problem.
11. University Syllabus
Theory <Syllabus as per RGPV>
Tutorials < Mention the tutorial part>

Practicals <Write the list of Experiment>
12. Books prescribed by the University
< List of books mentioned in the syllabus by the RGPV>
Additional books prescribed by the Tutor
< List of books other than those mentioned in the syllabus>
e- Resources / Software requirement if any; and its availability
< List to be presented here to satisfy the course learning>
13. Distribution of Course Work
Class Room contact
Ingredients
Number of Period
of 50 min
Marks
External Internal
Week Session of
15 weeks
MST TM Quiz /
Viva
Theory (L) 70 20 5 5
Tutorial (T)
Practical (P)
No. of Lectures Necessary for the course:45
14. Mapping of CO with POs and PSOs
(A)PROGRAMOUTCOMES (POs)
EngineeringGraduateswillbeableto:
1. Engineeringknowledge:Applytheknowledgeofmathematics,science,engineeringfundam
entals,andanengineeringspecializationtothesolutionofcomplexengineeringproblems.
2. Problemanalysis:Identify,formulate,reviewresearchliterature,andanalyzecomplexengineeri
ngproblemsreachingsubstantiatedconclusionsusingfirstprinciplesofmathematics,naturalscie
nces,andengineeringsciences.
3.
Design/developmentofsolutions:Designsolutionsforcomplexengineeringproblemsanddesig
nsystemcomponentsorprocessesthatmeetthespecifiedneedswithappropriate

considerationforthepublichealthandsafety,andthecultural,societal,andenvironmentalconsider
ations.
4.Conductinvestigationsofcomplexproblems:Useresearch-
basedknowledgeandresearchmethodsincludingdesignofexperiments,analysisandinterpretatio
nofdata,andsynthesisoftheinformationtoprovidevalidconclusions.
5.Moderntoolusage:Create,select,andapplyappropriatetechniques,resources,andmodernengine
eringandITtoolsincludingpredictionandmodelingtocomplexengineeringactivitieswithanun
derstandingofthelimitations.
6.Theengineerandsociety:Applyreasoninginformedbythecontextualknowledgetoassesssocietal
,health,safety,legalandculturalissuesandtheconsequentresponsibilitiesrelevanttotheprofess
ionalengineeringpractice.
7.Environmentandsustainability:Understandtheimpactoftheprofessionalengineeringsolutio
ns insocietalandenvironmentalcontexts,anddemonstratetheknowledgeof,andneedfor
sustainabledevelopment.
8.Ethics:Applyethicalprinciplesandcommittoprofessionalethicsandresponsibilitiesandnorms
oftheengineeringpractice.
9.Individualandteamwork:Functioneffectivelyasanindividual,andasamemberorleaderindivers
eteams,andinmultidisciplinarysettings.
10.Communication:Communicateeffectivelyoncomplexengineeringactivitieswiththeengineer
ingcommunityandwithsocietyatlarge,suchas,beingabletocomprehendandwriteeffectiverep
ortsanddesigndocumentation,makeeffectivepresentations,andgiveandreceiveclearinstructi
ons.
11.Projectmanagementandfinance:Demonstrateknowledgeandunderstandingoftheengineerin
gandmanagementprinciplesandapplythesetoone’sownwork,asamemberandleaderinateam,to
manageprojectsandinmultidisciplinaryenvironments.
12. Life-
longlearning:Recognizetheneedfor,andhavethepreparationandabilitytoengageinindependen
tandlife-longlearninginthebroadestcontext oftechnologicalchange.
B)PROGRAMSPECIFICOUTCOMES(PSOs)
1. Develop latest solutions for real world problems; applying mathematical, engineering and
project management skills through modern infrastructure and tools to benefit society and
human.
2. Understand the need for sustainable development and commit to professional ethics to
create an intelligent model that understand real world entities and their relationship to one
another.
3. Effectively communicate knowledge, thoughts, techniques and processes to community.
15. Prerequisites:
The students should have general idea about computing and mathematical concepts like Set,
Theory, Group, Function, Discrete Mathematics, Transition graph, Transition matrix.
S. No. CO
PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 C505.1 M L L M M M M M L
2 C505.2 L M H H M M H H H M M H M
3 C505.3 H H H M M H M M H H H M
4 C505.4 H H H M M H M M H H H M
5 C505.5 M M H H H M L M H M M M H M

16. Post Requisites:
The students able to design and moderate automata based upon current issue. Also student
should understand how Turing Machine is solving any type of current problem or real world
problem.
17. University Syllabus
Theory
Unit I **
Automata: Basic machine, FSM , Transition graph, Transition matrix, Deterministic and
nondeterministic FSM’S, Equivalence of DFA and NDFA, Mealy & Moore machines,
minimization of finite automata, Two-way finite automata.
Regular Sets and Regular Grammars: Alphabet, words, Operations, Regular sets, Finite
automata and regular expression, Myhill- Nerode theorem Pumping lemma and regular sets,
Application of pumping lemma, closure properties of regular sets.
19
Unit II **
Context –Free Grammars: Introduction to CFG, Regular Grammars, Derivation trees and
Ambiguity, Simplification of Context free grammars, Normal Forms (Chomsky Normal Form
and Greibach Normal forms).
08
Unit III **
Pushdown Automata: Definition of PDA, Deterministic Pushdown Automata, PDA
corresponding to given CFG, CFG corresponding to a given PDA.
Context Free Languages: The pumping lemma for CFL’s, Closure properties of CFL’s,
Decision problems involving CFL’s.
08
Unit IV **
Turing Machines: Introduction, TM model, representation and languages acceptability of
TM Design of TM,Universal TM & Other modification, Church’s hypothesis, composite &
iterated TM. Turing machine as enumerators.Properties of recursive & recursively
enumerable languages,Universal Turing machine.
06
Unit V **
Tractable and Untractable Problems: P, NP, NP complete and NP hard problems,
examples of these problems like satisfy ability problems, vertex cover problem, Hamiltonian
path problem, traveling sales man problem, Partition problem etc.
04
** No of Lecture required unit wise.
Tutorials: -For smooth conduction of tutorials we implements following steps
• Doubt Clearing session.
• Quiz Test.
• Discussed about related topics
18. Books prescribed by the University
1. Joha E. Hopcroft, Jeffery Ullman,”Introduction to Automata theory, Langauges&
computation” ,Narosa Publishers.
2. K.L.P. Mishra & N.Chandrasekaran,“Theory of Computer Science”, PHI Learning.
3. Michael Sipsev,“Theory of Computation”,Cenage Learning.

4. John C Martin, “Introdution to languages and theory of computation”, McGraw Hill.
5. Daniel I.A. Cohen,“Introduction to Computer Theory”,Wiley India.
6. Kohavi,”Switching & Finite Automata Theory”,TMH.
Additional books prescribed by the Tutor
a. K.V.N. Sunitha& N Kalyani, “Formal Languages and Automata Theory”, Tata Mc Graw-
Hill.
b. Peter Linz, "An Introduction to Formal Language and Automata", 4th Edition, Narosa
Publishing house , 2006.
c. M..Sipser, “Introduction to the Theory of Computation”, Singapore: Brooks/Cole, Thomson
Learning, 1997
Additional references
http://www.nptel.ac.in
19. Objective of Lab Work:
9.1 To give a good formal foundation on the Different Logical Gates.
9.2 To introduce how the machine are in different state for different input symbol.
9.3 To know evaluation criteria for different language.
9.4 To explain the concept of how the Turing Machine.
9.5 To give how NP hard problem is not solvable.
Value Addition:
1. Realize the knowledge of Pumping Lemma for find out given language is not Regular or
Context Free Language.
2. To present the concepts and techniques Automata
3. To present the concepts and techniques Turing Machine.
4. To present the issues and techniques why some problem is not solvable.
20. Time Schedules: Total expected periods from 1st
August 2016 to 2016 as per academic
Calendar, excluding sports week, holidays etc.
Ingredients Monday Tuesday Wednesday Thursday Friday Saturday Max.
Available
Required Excess
Theory
Tutorials

Practical’s
Difference of hours needed and hours available will be covered by additional classes.
21. Lecture and Tutorial Schedule
Lec.
No.
Unit Topic to Cover
CLO
Refererence
no. [page to
page].
Date of
completion
Students
present
01
U1 Automata
• Introduction
• Basic Machine
• FSM
• FSA
• Transition Graph
• Transition Matrix
1.1
1 [1-2]
4 [3-9]
1 [13-19]
4 [3-9]
2 [71-76]
02
Automata
• Define Deterministic Finite
State Automata (DFA)
1.1
1 [13-19]
2 [77-79]
03
Automata
• DFA with Example
1 [13-19]
2 [77-79]
04
Automata
• Solve problem of DFA
1 [13-19]
2 [77-79]
05
Automata
• Non Deterministic
Automata (NFA)
1 [19-21]
2 [77-79]
4 [123-132]
06
Automata
• Non Deterministic
Automata (NFA)
1.1
1 [19-21]
2 [77-79]
4 [123-132]
07
Automata
• Equivalence of DFA and
NDFA
1.1
1 [22-24]
2 [80-83]
08
Automata
• Transformation of NFA to
DFA
1.1
1 [22-24]
2 [80-83]
09
Automata
• Conversion of NFA with e-
Transition to NFA without
e-Transition
1.1 1 [24-27]
10
Automata
• Minimization of DFA’s
1.1
2 [91-97]
1 [67-71]
11
Automata
• Minimization of finite
automata
1.1
2 [91-97]
1 [67-71]
12 Automata
• Two-way finite automata
1.1 1 [36-42]

Lec.
No.
Unit Topic to Cover
CLO
Refererence
no. [page to
page].
Date of
completion
Students
present
13
Automata
• Mealy & Moore machines
1.1
1 [42-45]
2[84-90]
14
Automata
• Mealy & Moore machines
1.1
1 [42-45]
2[84-90]
15
U1
Regular Sets and Regular
Grammars
• Alphabet, Words, operation,
Regular Sets, Finite
Automata
1.1
1 [28-35]
2 [136-179]
4 [168-189]
16
Grammars
• Regular Expression
1.1
1 [28-35]
2 [136-179]
4 [168-189]
17
Grammars
• Myhill-Nerode Theorem
1.1 1 [65-67]
18
Grammars
• Pumping Lemma
1.1
1 [55-65]
2 [136-179]
19
Grammars
• Application of Pumping
Lemma
• Closure Properties of
Regular Sets.
1.1
1 [55-65]
2 [136-179]
20
U2 Context Free Grammar
• Introduction to CFG
• Regular Grammars
1.2
1 [77-82]
2 [180-181]
4 [203-220]
21
Context Free Grammar
• Derivation trees and
Ambiguity
1.2
1[82-87]
2 [181-188]
4 [220-232]
22
• Derivation trees and
Ambiguity
1.2
1[82-87]
2 [181-188]
4 [220-232]
23
• Simplification of Context
free grammars
1.2
1 [87-92]
2 [189-200]
4 [232-236]
24
free grammars
1.2
1 [87-92]
2 [189-200]
4 [232-236]
25
free grammars
1.2
1 [87-92]
2 [189-200]
4 [232-236]
26 Context Free Grammar
• Normal Forms
1.2 1 [92-103]
2 [201-212]
4 [236-240]

Lec.
No.
Unit Topic to Cover
CLO
Refererence
no. [page to
page].
Date of
completion
Students
present
27
• Normal Forms 1.2
1 [92-103]
2 [201-212]
4 [236-240]
28
U3
Pushdown Automata
• Definition of PDA
• Deterministic Pushdown
Automata
1.3
1 [107-112]
1 [112-115]
2 [227-229]
2 [230-233]
29
Pushdown Automata
• Non-Deterministic
Pushdown Automata
1.3
1 [112-115]
2 [230-233]
30
Pushdown Automata
• PDA corresponding to
given CFG
1.3
1 [115-120]
2 [240-245]
31
Pushdown Automata
• CFG corresponding to a
given PDA
1.3
1 [115-120]
2 [246-250]
32
Pushdown Automata
• CFG corresponding to a
given PDA
1.3
1 [115-120]
2 [246-250]
33
Context Free Languages
• Pumping Lemma for
CFL’s,
1.3
1 [125-130]
34
• Closure Properties of
CFL’s
1.3
1 [130-136]
35
• Decision Problem
involving CFL’s
1.3
1 [136-141]
36
U4 Turing Machines
• Introduction
• TM model
1.4 1[146-147]
37
Turing Machines
• Representation and
languages acceptability of
TM Design of TM
1.4 7[237-240]
38
Turing Machines
• Universal TM & Other
modification
1.4 7[255-256]
39
Turing Machines
• Properties of recursive &
recursively enumerable
Languages
1.4 7[255-256]
40 Turing Machines
• Church’s hypothesis
1.4 1[166-167]

Lec.
No.
Unit Topic to Cover
CLO
Refererence
no. [page to
page].
Date of
completion
Students
present
41
Turing Machines
• Composite and Iterated
TM
• Turing Machine as
Enumerators
1.4 1[167-170]
42
U5
Tractable and Untractable
Problems
• P
• NP
• NP Complete
1.5 1[320-324]
43
Problems
• NP Hard Problem
• Example of NP Hard
Problem
1.5 1[320-324]
44
Problems
• Satisfy Ability problem
• Vertex Cover Problem
• Hamiltonian Path Problem
1.5 1[324-336]
45
Problems
• Traveling Sales man
Problem
• Partition Problem
1.5 1[324-325]
Total Lecture Required = 45
Approved by: Prepared by:
Prof. DushyantVerma Prof. B.K.Mishra (Section A & B)
Prof. Sumit S Jain (Section C)
Co-Ordinator Department of CSE

Course file for theory of computation dt 08 08-2016.

More Related Content

What's hot (20)

Viewers also liked (6)

Similar to Course file for theory of computation dt 08 08-2016. (20)

Recently uploaded (20)

Course file for theory of computation dt 08 08-2016.