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-04] – [E-Learning:] ELICE 2025 Martin Ziegler25cs500 [2025-04-12] (current) – [Administration:] 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 44: Line 44:
 Grading: 20% attendance, 20% quizzes/participation, 20% homework, 20% midterm, 20% final exam \\ Grading: 20% attendance, 20% quizzes/participation, 20% homework, 20% midterm, 20% final exam \\
 Using this mix gives //everyone// the chance of passing  with sufficient grade... Using this mix gives //everyone// the chance of passing  with sufficient grade...
 +
 +Midterm: April 15, 16h~18h45, E11 #304 \\
 +Final Exam: June 10, 16h~18h45, E11 #304
  
 Prerequisites: CS204 (Discrete Mathematics), CS300 (Introduction to Algorithms) Prerequisites: CS204 (Discrete Mathematics), CS300 (Introduction to Algorithms)
Line 70: Line 73:
 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 ({{:cs500l.ppt|PPT}}, {{:cs500l.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}}) \\
Line 86: Line 89:
   * [[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}}
 +