COMP3711H (L1) - Honors Design and Analysis of Algorithms

Fall  2019  Lecture-Notes   Tutorials   Exam-Info   Course Policies   Announcements


Instructor:  Mordecai Golin

Office hours: (in Room 3559) by email appointment.



LEE Taegyoung 
SUN Zhida 


Time and Venues:

  • Lectures:
    Tuesday &  Thursday  10:30  - 11:50AM, Room 6591
  • Tutorial:
    Friday  12-12:50AM,   Lecture Theatre K



  • Algorithms    
    • Dasgupta, Papadimitriou, and Vazirani. McGraw Hill.


Other Reference Books:

  • Problems on Algorithms  (2nd ed)
    • Ian Parberry and William Gasarch (free book)
    • Note:  The author's website seems to be under reconstruction but you should be able to find a copy of the book by googling around.



Class Information:

  • Click  "Pages" on the left to see a list of all upper-level Canvas pages for this course.
    This includes Course Descriptions/Outcomes/Rubrics.  
    Many of those pages are also accessible directly via the links at the top of this page.


Assignment Information:

  • There will be 4 Assignments handed out during the semester as well as various extra credit problems.  See the Assignment Page for links to the individual assignments and extra credits.
  • The assignments will, in total, be worth 30% of the final grade.  The Midterm will also be worth 30% and the Final Exam will be worth 40%.



Exam Scheduling (Tentative):  

Midterm Monday, October 21, 2019 19:05-21:05
10 minutes earlier than previously announced
Room 1104
Entrance near LTA
Final Saturday,  Feb 22 2020 16:30 - 19:30  TBA



Intellectual Honesty & Plagiarism:

  • Students are expected to follow the HKUST Academic Honor Code
  • All work submitted for grading, e.g., assignments, must be your own
  • You are permitted to discuss problems with other students but you must write-up all solutions by yourself, in your own words.
  • If you got the main idea for a solution from another student or a web-site you must acknowledge that source in your submission.
  • Submission of non-acknowledged material will be considered as plagiarism and dealt with under the university policy for cheating.

Course Summary:

Date Details Due