Algorithm Design (SE3308)

Autumn Semester

to undergraduates, school of software

Textbook

[DPV07] S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani. Algorithms, 2007. [a local copy]

Lectures

Lecture 1. Prologue.

Lecture 2. Algorithms with Numbers I.

Lecture 3. Algorithms with Numbers II.

Lecture 4. Divide-and-Conquer I.

Lecture 5. Divide-and-Conquer II.

Lecture 6. Graph Algorithm I.

Lecture 7. Graph Algorithm II.

Lecture 8. Greedy Algorithms.

Lecture 9. Advanced data structures

Lecture 10. Dynamic Programming I.

Lecture 11. Dynamic Programming II.

Lecture 12. Linear Programming I.

Lecture 13. Linear Programming II.

Lecture 14. Linear Programming III.

Lecture 15. NP Problem I.

Lecture 16. NP Problem II.

Lecture 17. NP Problem III.

Lecture 18. Coping with NP I.

Lecture 19. Coping with NP II.

Lecture 20. Coping with NP III.

Lecture 21. Quantum algorithms.

Lecture 22. Geometric algorithms.

Lecture 23. Radomized algorithms.

Lecture 24. Conclusion

Materials

Guoqiang Li
Last modified: Sunday, May 19, 2024.