Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
25cs500 [2025-03-20] – Midterm+Final Martin Ziegler25cs500 [2025-06-26] (current) – [Syllabus/Slides] Martin Ziegler
Line 2: Line 2:
  
 All Computer Science is based on the concept of an efficient //algorithm//: as opposed to a //program// or a //heuristic//. All Computer Science is based on the concept of an efficient //algorithm//: as opposed to a //program// or a //heuristic//.
-We thus call these 'virtues' and features distinguishing CS from EE (Electrical Engineering):+We thus call these 'virtues' and features distinguishing CS (=Science) from EE (=Engineering):
  
   *     unambiguous problem specification   *     unambiguous problem specification
Line 38: Line 38:
 Language: English only Language: English only
  
-Teaching Assistants: [[cs500@theoryofcomputation.asia|현지훈+김소민+송민우]] \\+Teaching Assistants: [[cs500@theoryofcomputation.asia|현지훈+김소민+송민우]] (use only this email address!) \\
  
 Homework: Handwritten individual solutions (English only) and programming assignments in [[https://kaist.elice.io/|ELICE]]. Homework: Handwritten individual solutions (English only) and programming assignments in [[https://kaist.elice.io/|ELICE]].
Line 71: Line 71:
  
 ==== Syllabus/Slides ==== ==== Syllabus/Slides ====
 +
 +This course (pun) introduces "appetizer" chapters 
 +on some of the many topics in contemporary //Algorithm Design and Analysis//: \\
 +as an overview and to make you "hungry" for later perhaps pursuing a PhD in this field. \\
 +
 0.  Summary ({{:cs500z.ppt|PPT}}, {{:cs500z.pdf|PDF}}) \\ 0.  Summary ({{:cs500z.ppt|PPT}}, {{:cs500z.pdf|PDF}}) \\
 1.  Introduction  ({{:cs500a.ppt|PPT}}, {{:cs500a.pdf|PDF}}) \\ 1.  Introduction  ({{:cs500a.ppt|PPT}}, {{:cs500a.pdf|PDF}}) \\
-9. parallel Time ({{:cs500i.ppt|PPT}}, {{:cs500i.pdf|PDF}}) \\ +9. parallel Time ({{:cs500p.ppt|PPT}}, {{:cs500p.pdf|PDF}}) \\ 
-10. Memory ({{:cs500k.ppt|PPT}}, {{:cs500k.pdf|PDF}}) \\+10. Memory ({{:cs500m.ppt|PPT}}, {{:cs500m.pdf|PDF}}) \\
 11. Bonus: Quantum Computing ({{:cs500q.ppt|PPT}}, {{:cs500q.pdf|PDF}}) \\ 11. Bonus: Quantum Computing ({{:cs500q.ppt|PPT}}, {{:cs500q.pdf|PDF}}) \\
 5. Randomized/Expected Analysis  ({{:cs500e.ppt|PPT}}, {{:cs500e.pdf|PDF}}) \\ 5. Randomized/Expected Analysis  ({{:cs500e.ppt|PPT}}, {{:cs500e.pdf|PDF}}) \\
 3. Average-Case Analysis ({{:cs500c.ppt|PPT}}, {{:cs500c.pdf|PDF}}) \\ 3. Average-Case Analysis ({{:cs500c.ppt|PPT}}, {{:cs500c.pdf|PDF}}) \\
-2. Tree Data Structures ({{:cs500b.ppt|PPT}}, {{:cs500b.pdf|PDF}}) \\ 
-4. Amortized Analysis ({{:cs500d.ppt|PPT}}, {{:cs500d.pdf|PDF}}) \\ 
 6. Online/Competitive Analysis ({{:cs500f.ppt|PPT}}, {{:cs500f.pdf|PDF}}) \\ 6. Online/Competitive Analysis ({{:cs500f.ppt|PPT}}, {{:cs500f.pdf|PDF}}) \\
-7. P/NP Intermission ({{:cs500g.ppt|PPT}}, {{:cs500g.pdf|PDF}}) \\ +8. Approximation  ({{:cs500h.ppt|PPT}}, {{:cs500h.pdf|PDF}})
-8. Approximation  ({{:cs500h.ppt|PPT}}, {{:cs500h.pdf|PDF}}) \\ +
 ==== E-Learning: ==== ==== E-Learning: ====
   * [[https://klms.kaist.ac.kr/course/view.php?id=169186|KLMS]]   * [[https://klms.kaist.ac.kr/course/view.php?id=169186|KLMS]]
Line 89: Line 90:
   * [[http://youtube.com/playlist?list=PLvcvykdwsGNH94LPIF6g5vtFkcQ5fqN17|YouTube]]   * [[http://youtube.com/playlist?list=PLvcvykdwsGNH94LPIF6g5vtFkcQ5fqN17|YouTube]]
   * {{averagequicksort.pdf|Average-Case Analysis of QuickSort}}   * {{averagequicksort.pdf|Average-Case Analysis of QuickSort}}
 +