Algorithmics and programming, ENS L3 (2018–2019)

Course material for Algorithmics and programming in L3 computer science at ENS. Only slides authored by Pierre Senellart are provided here.

Slides

0. Course Organization
1. Introduction to algorithmics
2. Dynamic programming and greedy algorithms

Lecture outlines (chapters without slides)

• Divide and conquer
• Associative data structures
• Union-Find
• Minimum spanning trees

Assessments

• Algorithms & Programming: Retake Exam
• Remedial exam

---

Contact: pierre@senellart.com

Last Modification
UTC