Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
24cs500 [2025-02-24] – [Synopsis] Martin Ziegler | 24cs500 [2025-06-26] (current) – [Syllabus/Slides] Martin Ziegler | ||
---|---|---|---|
Line 2: | Line 2: | ||
All Computer Science is based on the concept of an efficient // | All Computer Science is based on the concept of an efficient // | ||
- | We thus call these ' | + | We thus call these ' |
* | * | ||
Line 66: | Line 66: | ||
==== Syllabus/ | ==== Syllabus/ | ||
+ | |||
+ | This course (pun) introduces " | ||
+ | on some of the many topics in contemporary //Algorithm Design and Analysis//: \\ | ||
+ | as an overview and to make you " | ||
+ | |||
1. Recap, Intro & Overview | 1. Recap, Intro & Overview | ||
- | 9. Parallel Algorithms ({{:cs500i.ppt|PPT}}, {{:cs500i.pdf|PDF}}) \\ | + | 9. Parallel Algorithms ({{:cs500p.ppt|PPT}}, {{:cs500p.pdf|PDF}}) \\ |
- | 10. Memory-Efficient Algorithms ({{:cs500k.ppt|PPT}}, {{:cs500k.pdf|PDF}}) \\ | + | 10. Memory-Efficient Algorithms ({{:cs500m.ppt|PPT}}, {{:cs500m.pdf|PDF}}) \\ |
5. Randomized/ | 5. Randomized/ | ||
3. Average-Case Analysis ({{: | 3. Average-Case Analysis ({{: | ||
Line 83: | Line 88: | ||
Instead use KLMS to reach out to the TAs (preferred), | Instead use KLMS to reach out to the TAs (preferred), | ||
or write to the dedicated email address [[cs500@theoryofcomputation.asia|cs500@theoryofcomputation.asia]]. | or write to the dedicated email address [[cs500@theoryofcomputation.asia|cs500@theoryofcomputation.asia]]. | ||
+ |