COMP3711 (L1, L2) - Design and Analysis of Algorithms

Spring 2025

• Course Description, Outcomes, Rubrics, and Grade Descriptors    
• Lecture Materials
• Lecture Progress and Videos:  L1, L2  
• Tutorials   
• Midterm and Exam Info    
• Grading and Course Policies   

The midterm will be held on March 19 from 7:30 pm to 9:30 pm.

Instructors:

• L1: Siu-Wing CHENG (scheng@cse.ust.hk)
• L2: Dimitris Papadias (dimitris@cse.ust.hk)

Teaching Assistants:  

• Arman Haghighi (armanh@ust.hk)
• Teck Kwang Tan (tktan@connect.ust.hk)
• Zhengjun Huang (zhuangff@connect.ust.hk)
• Pengbo Li (plibt@connect.ust.hk)
• Barakeel Fanseu Kamhoua (bfk@connect.ust.hk)
• Hau Ching Lo (hcloaf@connect.ust.hk)

Lecture Times & Venues

Tutorials (identical contents across all tutorial sessions within the same week)

Textbook

1. Cormen, C. Leiserson, R. Rivest, C. Stein. Introduction to Algorithms,
    MIT Press.

Reference Books

2. Jon Kleinberg and Éva Tardos.  Algorithm Design, Addison-Wesley.

3. Jeff Erikson.  Algorithms,  (Free Book)

4. Ian Parberry and William Gasarch.  Problems on Algorithms (Links to an external site.), (2nd ed),  (Free Book)

Intellectual Honesty & Plagiarism

• Students are expected to follow the HKUST Academic Honor CodeLinks to an external site.
• 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.