Documente Academic
Documente Profesional
Documente Cultură
UNIVERSITY
Name of Institute
[Department/college/school
Name]
[Logo]
Course ECTS: 5
Course Information:
Academic Year: -------Semester:
Meeting day:--Meeting time:--Meeting location:-----
1. Course Description:
Complexity Theory course is to make students to grasp the general
and basic knowledge of Turing Machine and construction of Turing
Machine, the importance of time and space complexities, various
notations and theorems of Complexity theory
2. .Course Goals or Learning Outcomes:
By the end of this course, students will be able to:
4. Required Texts:
Text Book:
Complexity Theory: A Modern Approach Sanjeev Arora and Boaz Barak
References:
Computability and Complexity Theory (Texts in Computer Science)
by Steven Homer (Author), Alan L. Selman (Author) Publisher: Springer; 1 edition.
Combinatorial Optimization: Algorithms and Complexity by Christos H.
Papadimitriou.
Computational Complexity. C.H. Papadimitriou.
M. R. Garey & D. S. Johnson. Computers and Intractability: A Guide to the Theory
of NP-completeness. The classic work on NP-completeness.
D. Z. Du and K. Ko. Theory of Computational Complexity. An advanced book with
lots of details about many topics.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and
Computation. Somewhat terse, but a good reference for much of the material we'll be
covering early in the course.
5. Summary of Teaching Learning Methods:
The learningteaching methodology will be student-centered with appropriate guidance of
instructor/s during the students activities .There will be
Lecture,
Presentation
Reading assignments and Group Discussions
6. Summary of Assessment Methods:
The course will be assessed using the different assessment methods like:
Quizzes,
Reading assessments,
Assignments,
Final exam
7. Policies on incomplete grade and late assignments:
Homework deadlines will be hard. Late homework will be accepted with a 10% reduction
in grade for each class period they are late by. However, once a homework assignment is
discussed in class or the solution is posted, submissions will no longer be accepted. All
assignments must be turned in before the start of class on the due date.
9. Student Workload: Taking into consideration that 1ECTS accounts for 27 hours of student
work, the course Internet Programming has 5*27hr=135 hrs the split up is as shown below:-:
Work load
Hour
Lectures
48
Tutorials
16
Home Study
71
Total
135
10. Polices:
Grading policies
Student grade and performance will be evaluated as the whole activities (tests (quiz)
(40%) + Assignment (20%) +final exam (40%)) =total (100%).
The final score will be converted to a letter grade using the following scale:
Raw mark interval
Corresponding
Corresponding Fixed
[100%]
[90,100]
[85,90)
[80,85)
[75,80)
[70,75)
[65,70)
[60-65)
[50,60)
[45,50)
[40,45)
[30,40)
[<30)
Letter Grade
A+
A
AB+
B
BC+
C
CD
FX
F
Number grade
4.00
4.00
3.75
3.50
3.00
2.75
2.50
2.00
1.75
1.00
0.00
0.00
Remark
11. Schedule:
The following is an outline of the order in which syllabus contents will be covered. The exact
dates and due dates for assignments and exams can be found on the class calendar and are
subject to change with notice.
Week/Date
Content
Additional Reference
Week 1,2,3 CHAPTER I: Turing Machine (TM)
Standard TM
Construction of TMs
Week 4,5,6,7 CHAPTER II: Undecidability
Week
Turing Decidable
Turing Acceptable
Undecidable Problems
8,9,10,11
Recursive Functions
Recursive Languages
Recursively Enumerable
Languages
CHAPTER IV: Computational
Week
12,13,14,15
Complexity
Big-O Notation
Polynomial Time
Reduction and NPComplete Problems
Week 16
Cooks Theorem
Final Exam
9. Assessment Arrangements:
List the assessment methods along with weight distribution. (Tests (quiz) (20%) +lab
exam (20%) +project (20%) +final exam (40%)) =total (100%).
Tests, Quizzes, reading assessment and tutorial contributions
40%
Assignment
20%
Final Examination
40%
Total
100%