COMP 3711 Design and Analysis of Algorithms

Fall 2020

Lecture L1	Prof. Siu-Wing Cheng, Rm 3551, scheng@cse.ust.hk	Tu, Th: 15:00-16:20
Lecture L2	Prof. Dimitris Papadias, Rm 3555, dimitris@cse.ust.hk	Mo, We: 12:00-13:20
Tutorial T1	TBA	Th: 18:00-18:50
Tutorial T2	TBA	Fr: 12:00-12:50
Tutorial T3	TBA	Fr: 10:30-11:20

Textbook: Introduction to Algorithms by T.H. Cormen, C. Leiserson, R. Rivest, and C. Stein, MIT Press, 3rd edition, 2009.

Tentative Grading Scheme:

• (50%) Written assignments.  All assignments must be submitted online.
• (50%) Final examination.  Format to be determined later.

Slides and Video Links

We will post in advance the slides for the coming week. After each lecture, we will also post a link to the video of the lecture, and the updated slides which may contain additional exercises solved during the lecture. 

Tentative Syllabus:

· Course Mechanics - Review of Asymptotic Notation

• Introduction to Algorithms
• Divide and conquer
• Master Theorem
• Randomized algorithms
• Quicksort, Heapsort, Linearsort
• Balanced binary search tree
• Greedy algorithms
• Huffman encoding
• Dynamic programming
• Graph search algorithms
• Shortest path
• Maximum flow
• Stable marriage
• String matching
• Hashing

See CANVAS page for slides and video recordings of the lectures