Model 2.4
Faculty member + student
Course syllabus for 314CSC .
1. Faculty member information:
Name of faculty member responsible for the course
L. Nada ALZaben
Office Hours
MON 10-11 and WED 10-11
Office Number
2.501.73
Email
Nada_pnu@yahoo.com
2 . Course overview and general information:
College / Department
Computer Science and Information / Computer Science
Course Name and code
Formal Languages and Automata Theory – 314 CSC
Number of credit hours
3 hours
نيطبابلا .م ـه 1435 يميداكلأا دامتعلااو ةدوجلا نامض ةدامع
1

Program or programs that offer this course
The Bachelor of Computer and Information Sciences in computer science.
Year/course level
1434-1435 second semester / starting from level 6
Prerequisites for this course (if any)
Discrete Structure 310 CSC
Current requirements for this course (if any)
None
Site (to be given if not inside the main building of the institution)
3. Objectives of the course:
 Dealing with regular and context-free languages; construct, understand and apply their formal descriptions.
 Describing relations between languages and language classes.
 Applying basic parsing methods.
 Explaining the difference between decidable and undecidable problems
نيطبابلا .م ـه 1435 يميداكلأا دامتعلااو ةدوجلا نامض ةدامع
2

4. Course description:
10
11
12
13
14
15
7
8
9
2
3
4
5
6
Week
1
Date Topic
25/3/
1435
Introduction to the course content, text book(s), reference(s) and course plan.
Automata, computability and complexity
Mathematical Notions and
Terminology
2/4/
1435
9/4/
1435
16/4/
1435
23/4/
1435
1/5/
1435
8/5/
1435
15/5/
1435
22/5/
1435
29/5/
1435
6/6/
1435
13/6/
1435
20/6/
1435
27/6/
1435
5/7/
1435
Regular Languages
Context-Free Languages
Turing Machines
Decidability
Reducibility
Recursion Theorem
Decidability of logical
Theories
Time Complexity
Space Complexity
Intractability
Approximation Algorithms
Probabilistic Algorithms
Alternation and proof systems
Activity Intended learning outcomes
Assessment methods
نيطبابلا .م ـه 1435 يميداكلأا دامتعلااو ةدوجلا نامض ةدامع
3

5. Books and references:
“ INTRODUCTION TO THE THEORY OF COMPUTATION”, by Michael
Sipser
6. Assessment methods and the division of grades:
Assessment method
(Write an essay - test - a collective project - a final test ...)
Work sheets
Assessment Week
4 work sheets
Quiz #1
Quiz #2
TUE 25/4/1435
TUE 01/6/1435
Midterm #1
Midterm #2
Project
Class participation
Final exam
Total
TUE 10/5/1435
TUE 15/6/1435
MON 28/6/1435
Every lecture
SUN 19/7/1435
Grade
10
5
15
15
10
5
40
100
Percentage from overall grade
Comments
10%
5%
15%
15%
10%
5%
40%
100%
Every sheet covers from 2-
3 chapters
Oral questions
7. Instructions (if any):
نيطبابلا .م ـه 1435 يميداكلأا دامتعلااو ةدوجلا نامض ةدامع
4