COMP9601 - Theory of Computation and Algorithm Design
Semester 1, 2016-17
This is a Graduate Course. MPhil/PhD students in the Department of Computer Science should read the Coursework Requirement.
Instructor Dr. Z. Huang
Syllabus This course presents principles of theoretical computer science focusing on algorithmic design and complexity analysis. Topics include: theoretical models of computation; computational complexity; design and analysis of algorithms and data structures (possible topics: graphs, pattern matching, computational geometry); approximation and online algorithms.
Pre-requisites "CSIS0250/COMP3250 Design and Analysis of Algorithms" or equivalent
Instructor's web  
  • In-course assessment:
  • Examination marks:

Teaching Period: September 1, 2016 - November 30, 2016
Reading Week: October 17, 2016 - October 22, 2016

Date Start Time End Time Venue Remark
Tuesday 3:30pm 5:00pm Rm142, Main Bldg


Thursday 3:30pm 5:00pm Rm142, Main Bldg  
Discussion board Newsgroup: news:// Login using CS account

- End -