National Computer Education Accreditation Council

NCEAC
NCEAC.FORM.001-C

INSTITUTION FAST - National University of Computers and Emerging

Sciences

BS - Computer Science

PROGRAM (S) TO BE
EVALUATED

A. Course Description

1 NCEAC.FORM.001.C
 National Computer Education Accreditation Council
NCEAC
NCEAC.FORM.001-C
(Fill out the following table for each course in your computer science curriculum. A filled out form should
not be more than 2-3 pages.)

Course Title Theory of Computation / Automata

Course Code CS301 Credit Hours 3+0
Prerequisites by
Discrete Structures Semester Spring 2019
Course(s)
Semester Work 25% (Includes project (optionally) (5%) , assignments (10%), and
Assessment Instruments quizzes (10%))
(with tentative weights) Midterm 25% (Mid semester exam – Week 6 and Week 12)
Final 50% (Comprehensive end of semester exam)
Course Instructor M. Shahzad | mshahzad@nu.edu.pk
Office Hours Details displayed outside my Room # 6 (CS Block). Open door policy.
Discussion Group
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Introduction to Automata
Theory, Languages, and Computation
Reference Book(s) 2. P. Linz. Introduction to Formal Languages and Automata, 6th edition, 2017 (or
Please keep a personal 5th or 4th edition), Jones and Barlett
copy of either Ullman or 3. Daniel I. A. Cohen, Introduction to Computer Theory
Cohen 4. John Martin, Introduction to Languages and the Theory of Computation, Third
Edition
5. Michael Sipser, Introduction to Theory of Computation
1. Provide mathematical maturity in the field of computer science.
2. Develop skills of precise and formal reasoning.
3. Describe the role of abstract computational models to define which computational
problems are solvable and which are not.
Course Goals 4. Define formal languages and their description in the form of formal grammars.
5. Design grammars and models for different languages.
6. Differentiate between deterministic and non-deterministic models and their
limitations.

2 NCEAC.FORM.001.C
 National Computer Education Accreditation Council
NCEAC
NCEAC.FORM.001-C
W Le Topics Chapters
e ctu
e re
k #
#
1. 1 Discussion on [HMU]:1.1
. Course Outline, [Linz]: 1
Introduction to
Finite Automata
2 What does [HMU]: 1.5
. automata [DC]: 1
means?
Introduction to
Languages,
Alphabets,
Strings
3 Kleene Star [DC]: 4
. Closure, Regular [HMU]: 3
Expression (RE) [JM]: 3
[Linz]: 3

2. 1 Equivalent RE, [HMU]: 2

. Finite Automaton [JM]: 2
(FAs), Equivalent [MS]: 1
FAs
2 FA corresponding [Linz]: 2.1
. to finite [DC]: 6
languages,
Transition Graph
3 Continued
.

3. 1 Examples of [Linz]: 2
. TGs: accepting [DC]: 6
all strings,
accepting none,
starting with b,
not ending in b,
containing aa,
containing aa or
bb.
2 Generalized [DC]: 6
. Transition Graph
3 Language [Linz]: 2.2
. accepted by [HMU]:2.3
NFA, Recursive
definition of NFA

4. 1 Basis Clause and [Instructor

. Inductive Clause Notes]
of NFA
2 NFA with Λ [Instructor
. Transitions, Notes]
Language
3 accepted by NCEAC.FORM.001.C
NFA- Λ,
Definition of Λ-
Closure, Basis
Clause and
 of NFA- Λ
3 Conversion of [Instructor
. NFA- Λ to Notes]
equivalent NFA
National Computer Education Accreditation Council
NCEAC5. 1 Conversion
. NFA
of [Instructor
to Notes]
equivalent DFA
2 Equivalence of [Instructor NCEAC.FORM.001-C
Problem
. DFAs, NFAs and Notes] Social and
Class Time Spent on Theory Solution Design
NFA- Λ Analysis Ethical Issues
(in credit hours) 315Kleene’s 15[JM]: 3.4, 15 3
. Theorem Part-1 3.5
Oral and Written Every student is required to submit
& Part-2 [DC]:at7least ___1__ written reports of typically __3-4_
Communications pages and to make __1___ oral presentations of typically __15___ minute’s duration.
Plagiarism
6. 1 is strictly prohibited and would be strictly dealt with. Late submission of
assignment
. will be allowed until its solution is discussed. It is better to partially
attempt 2what
Mid-Iyou understand and submit remaining as late, than to copy from
someone . else or internet.
Examination
Academic Integrity - Max3 Grade penalty of 50% (in assignment) for late submit.
- Min. Grade penalty of 100% (in course) for plagiarism.
Zero tolerance on cheating When taking help in your assignments (from web)
as per FAST Policies. All 7. - Cite1 reference
Complement clearly,ofmentioning
[Instructor
URL and content taken.
Cases (in any Assessment . Regular Notes]
- Even Language
if referred, it isand
still plagiarism to use the same sentence or change it in
Instruments) will be
active/passive
Complement form. Useof your own words, ALWAYS!.
referred to department
committee. When taking DFA, help in your assignments (from peers)
- Discussing assignments
Intersection of with peers is allowed only on discussion group. Do not
provideRegular
excuses later.
Languages
- Provide help in form of explaining problem rather than explaining solution.
Group2 Properties
discussion of is RLs [Linz]: 4
encouraged.
. [HMU]: 4
- Attendance and Quizzes will be held in start of class.
3 Pumping Lemma [HMU]: 4.1
- Exams
. may be open book[JM]: (closed
2.4 notes). Please do NOT write or mark
Evaluation Policy anything on the book.
- There will be NO compensation for missed quiz.
For FAST Policies please 8. - All1graded evaluationsofwill[Instructor
Minimization be property of the instructor.
read the student . DFA
- Take classes only with your Notes]
section, assigned by FAST CS dept.
handbook. - IMPORTANT: Always send [HMU]: 4.4 day EMAIL reminder if I give you any
me same
2 Mealy & Moore [DC]: 9
verbal comment e.g class participation bonus, late submission allowed, leave
. Machines
allowed, average marks etc.
3 Conversion [Instructor
. between Mealy & Notes]
Moore Machines

9. 1 Regular [DC]: 13
. Grammars, [MS]: 2
Linear Grammar,
Context-free
Languages
(CFL), Context-
free grammars
(CFG).
2 Parse Trees, [DC]: 20
. Derivations and [Linz]: 6.2
ambiguity and
Chomsky-normal-
form grammars
(CNF), Null
Production
3 Trees, Polish [JM]: 4.4
. Notations, Total
Language Tree
4 NCEAC.FORM.001.C
1 1 Push down [JM]: 5
0. . automata (PDA) [DC]: 17
[MS]: 2.2
2 Deterministic