Lecturer: Xiaohui Bei ()

Lecture Schedule:

- Tutorial: Tuesday 10:30am - 11:30am, SPMS-TR+17 (biweekly) - Office hour: Tuesday 11:30am - 12:30am, SPMS-05-46


Material covered

The class consists of two parts: algorithms and complexity. The first part will give a introduction to general algorithm design paradigms as well as algorithms for several specific problems. The second part will talk about topics of automata theory, NP-completeness, and computability.


Homework Assignments

Homework policy: You are allowed (and encouraged) to discuss with your peers on the questions and solutions. But everyone needs to write and submit their own solutions.

Homework can be submitted by (as PDF files obtained from LaTeX or Word sources), or by pushing a hard copy under my office door (MAS-05-46).


Exercise questions are for you to review the lecture contents. The solutions are also provided. It is strongly recommended to solve the exercise problems first and then compare your solutions to the standard answers, rather than to check the answers directly.

If you spot any mistakes in the questions or solutions (there definitely might be!), please do not hesitate to send me an email to check.

Recommended Texts

There is no required textbook for this course. However, the following books are recommended: