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
18cs300 [2018-12-14] – [Introduction to Algorithms (CS300) in Fall 2018 at KAIST's School of Computing] Martin Ziegler18cs300 [2021-07-31] (current) Martin Ziegler
Line 9: Line 9:
   *     with proof of asymptotic optimality.    *     with proof of asymptotic optimality. 
  
-We will learn all about important basic algorithms and their analysis.+We will learn all about important basic algorithms and their analysis
 +as well as the difference to heuristics or programs/code.
 Their practical impact is demonstrated in selected implementations. Their practical impact is demonstrated in selected implementations.
  
Line 30: Line 31:
 Written **midterm** exam on Wednesday October 17 at 16h30 in E11 Terman Hall. \\ Written **midterm** exam on Wednesday October 17 at 16h30 in E11 Terman Hall. \\
 Written **final** exam on Wednesday December **5** at 10h30 in E3-1 #1501. \\ Written **final** exam on Wednesday December **5** at 10h30 in E3-1 #1501. \\
-**[[https://kaist.elice.io/courses/532/lectures/5377|Final ELICE assignment]]** due Monday, Dec.17 10am+**[[https://kaist.elice.io/courses/532/lectures/5377|Final ELICE assignment]]** due Monday, Dec.18 11am
-  Final/hw#8 claiming hour on Dec.1**8** at 11am in E3-1 #4443+  Final/hw#8 claiming hour on Dec.18 at 11am in E3-1 #4443
  
  
Line 64: Line 65:
 ===== Synopsis/Syllabus: ===== ===== Synopsis/Syllabus: =====
  
-  - {{ :cs300a.ppt |Computational Problems and Algorithmic Solutions}}+  - {{ :18cs300a.ppt |Motivation}}
     * Virtues of Computer //Science//:     * Virtues of Computer //Science//:
     * Problem specification     * Problem specification