COMP3711 (L1, L2) - Design and Analysis of Algorithms
Fall 2022
Course Outcomes and Rubrics Syllabus and Lecture-Notes
Lecture Progress and Videos Tutorials
Midterm and Final Exam Info Grading and Course Policies
Instructor
Siu-Wing CHENG, Dimitris Papadias
E-mail: scheng@cse.ust.hk, dimitris@cse.ust.hk
- Prof. Cheng will be teaching both L1 and L2 before the midterm. Prof. Papadias will be teaching both L1 and L2 after the midterm. Videos of lectures will be posted after the lectures.
- Tutorials will be conducted face to face. They will not be recorded, so no videos of tutorials will be available afterwards.
- The proctored midterm will be in the evening of October 20, 2022. Further information can be found here. You will need to attend the midterm physically on campus.
Teaching Assistants:
- Huiru Xiao, hxiaoaf@connect.ust.hk
- Kirill Voloshin, kvoloshin@connect.ust.hk
- Yukun Zhao, yzhaoeg@connect.ust.hk
- Arman Haghighi, ahaghighi@connect.ust.hk
- Helbert Agluba Paat, hpaat@connect.ust.hk
Lecture Times & Venues
| L1 | Monday | LTC | 13:30 - 14:50 |
| L1 | Friday | LTC | 09:00 - 10:20 |
| L2 | Wednesday, Friday | LTB | 13:30 - 14:50 |
Tutorials
| T1 | Friday | LTF | 12:30 - 13:20 | First session on Sept 9 |
| T2 | Friday | CYTG010 | 15:00 - 15:50 | First session on Sept 9 |
Textbook
1. Cormen, C. Leiserson, R. Rivest, C. Stein. Introduction to Algorithms,
Third Edition, MIT Press. [e-version]
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 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 |
|---|---|---|