COMP9601 - Theory of Computation and Algorithms Design
Semester 1, 2014-15
This is a Graduate Course. MPhil/PhD students in the Department of Computer Science should read the Coursework Requirement.
Instructor Prof. T.W. Lam
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, 2014 - November 29, 2014
Reading Week: October 13, 2014 - October 18, 2014

Date Start Time End Time Venue Remark
Tuesday 10:30am 12:00nn Room 308, Chow Yei Ching Bldg


Thursday 10:30am 12:00nn Room 308, Chow Yei Ching Bldg  
Discussion board Newsgroup: news:// Login using CS account

- End -