COURSE OUTLINE
Department & Faculty: Dept. of Software
Engineering, Faculty of Computing
Course Code: SCJ3203 / SCSJ3203
Course Name : Theory of Computer Science
Total Contact Hours: 42 hours
Course Pre-requisite: Data Structures and
Algorithms
Page : 1 of 3
Semester: I
Academic Session: 2014/2015
Lecturer
:
Dr Zalmiyah Binti Zakaria
Room No.
:
N28A, Level 5, Room No. 16, Fakulti Komputeran
Telephone No.
:
07-5538814
E-mail
:
zalmiyah@utm.my
Synopsis
:
This course introduces students to formal languages and automata theory. It
will emphasize on grammar, language and abstract machine such as Regular
Grammar, Context Free Grammar, Finite Automata, Push Down Automata, and
Turing Machine. The course will also provide practice on the acceptability of
data by these machines. At the end of the course, students should be able to
apply the theory in constructing this abstract machine and testing them with
the right data.
LEARNING OUTCOMES
By the end of the course, students should be able to:
Course Learning Outcome
No.
Programme Learning
Outcome(s) Addressed
Assessment Methods
1.
Describe the theory of Computer Science.
PO1 (C2)
Tu, Q, T, F
2.
Apply and explain the theory in solving the
given problems.
PO2 (P3)
Tu, Q, T, F
3.
Discuss and make decision to solve problems
related to computer science theory.
PO6 (A2)
Tu, A
4.
Work collaboratively in a team to solve
problems using current information related
to computer science theory.
P10 (A3)
A, Pr
(Q - Quiz; A –
Assignment; Tu –
Tutorial; Pr – Peer
review, presentation; T
– Test; F – Final Exam)
Prepared by:
Name: Zalmiyah Binti Zakaria
Signature:
Date: 10 May 2012
Certified by: (Course Panel Head)
Name:
Signature:
Date:
STUDENT LEARNING TIME
Teaching and Learning Activities
 Lecturer Centered
 Student Centered
Face to face
Learning
Lecture
- Practical/Lab/Tutorial
- Student Centered Activity
- Others
 Others




Self Learning



Formal
Assessment
Sub Total
Non Face to face or Student Centered Learning (SCL)
Revision
Assessment Preparation
Others
Sub Total
Continuous Evaluation
Final Examination
Others
Sub Total
Student Learning
Time (hours)
25
13
9
0
0
47
45
12
10
67
3
3
TOTAL SLT
120
TEACHING METHODOLOGY
Lecture and Discussion, Co-operative Learning, Independent Study
WEEKLY SCHEDULE
Week 1
(8/9/2014)
1.0 Mathematical preliminaries
1.1 Theory of sets
Activities/hours
Lecture : 2
Tutorial: 1
Assessment: Tutorial 1
Week 2-3
(15 &
22/9/2014)
2.0
2.1
2.2
2.3
Lecture : 4
Tutorial: 2
Assessment: Tutorial 2,
Tutorial 3, Quiz 1
Weeks 4-6
(29/9 &
13/10/2014)
3.0 Context Free Grammars
3.1 Grammars and languages
3.2 Derivation Trees
3.3 Regular Grammars
Week 7
(19/10/2014)
SEMESTER BREAK
Weeks 8-10
(27 &
3/10/2014 &
10/11/2014)
4.0
4.1
4.2
4.3
Languages
Language and string
Finite specification of language
Regular set and expressions
Finite Automata
Deterministic Finite Automata (DFA)
State Diagram
Non Deterministic Finite Automata (NFA)
6
Lecture : 4
Tutorial: 2
Assessment: Quiz 2,
Tutorial 4, Tutorial 5,
Assignment 1
Lecture : 4
Tutorial: 2
Assessment: Tutorial 6,
Tutorial 7, Quiz 3,
4.4 Finite automata and Regular set
4.8 Regular grammars and automata
Assignment 2, Test (10
November 2014, 2.30pm,
BK1-BK6, N28)
Week 11-12
(17 &
24/11/2014)
5.0 Push Down Automata (PDA)
5.1 Push Down Automata
5.2 Context Free Language (CFL)
Lecture : 4
Tutorial: 2
Assessment: Quiz 4,
Tutorial 8, Tutorial 9
Week 13-14
(1 &
8/12/2014)
6.0
6.1
6.2
Lecture : 4
Tutorial: 2
Assessment: Tutorial 10,
Tutorial 11
Week 15
(15/12/2014)
7.0 Chomsky Hierarchy
7.1 Grammars
7.2 Language levels 0, 1, 2, 3
Week 16
(21/12/2014)
8.0 Revision
REFERENCES
Turing Machine
Standard Turing Machine
Turing machine as language acceptor
Lecture : 1
Tutorial: 1
Assessment: Quiz 5,
Tutorial 12
:
1. Thomas Sudkamp, Language and machine, Pearson Int. Edition, Third Edition, 2006.
2. John C. Martin, Introduction to Languages and the Theory of Computation, Fourth Edition, 2011.
3. Michael Sipser, Introduction to the Theory of Computation, Cengage Learning, Third Edition,
2013.
4. Elaine Rich. Automata, Computability and Complexity. Pearson International Edition. Pearson
Prentice Hall. 2009.
GRADING
No.
Assessment
Number
% each
% total
1
Assignments
2
5%
10
2
Tutorials
10 of 12
2%
20
3
Quizzes
4 of 5
2.5%
10
4
Mid-Term Test
1
25%
25
5
Final Exam
1
35%
35
Overall Total
100