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
Last revisionBoth sides next revision
20cs500 [2020-04-28] – [Syllabus/Slides] Martin Ziegler20cs500 [2020-06-18] – [Syllabus/Slides] Martin Ziegler
Line 39: Line 39:
 Final exam: TBD Final exam: TBD
  
-Prerequisites: CS204 (Discrete Mathematics), CS206 (Data Structures), CS300 (Introduction to Algorithms)+Prerequisites: CS204 (Discrete Mathematics), CS300 (Introduction to Algorithms)
  
 ==== Literature ==== ==== Literature ====
Line 60: Line 60:
 2. Examples ({{cs500b.pdf|pdf}},{{cs500b.ppt|ppt}},[[https://drive.google.com/open?id=1LTm1EgD2LRAsOcpDbsvqT0o2sXuMSw2m&export=download|video]])  \\ 2. Examples ({{cs500b.pdf|pdf}},{{cs500b.ppt|ppt}},[[https://drive.google.com/open?id=1LTm1EgD2LRAsOcpDbsvqT0o2sXuMSw2m&export=download|video]])  \\
 3. Tree Data Structures ({{cs500c.pdf|pdf}},{{cs500c.ppt|ppt}},[[https://drive.google.com/open?id=1rDbqo36yyAAGpvOD55RGV3TI0ZghpT4q|video1]],[[https://drive.google.com/open?id=1MAks9njNpjYZCYx-XmxYGSjFNdm8EeSX|video2]],[[https://drive.google.com/open?id=10g31aJvRBczMFA2g_hZv7vUCrheKMzwg|video3]],[[https://drive.google.com/open?id=1AwFNY1FFgP6HE_55ls_Ate0rgTqgAHiC|video4]])\\ 3. Tree Data Structures ({{cs500c.pdf|pdf}},{{cs500c.ppt|ppt}},[[https://drive.google.com/open?id=1rDbqo36yyAAGpvOD55RGV3TI0ZghpT4q|video1]],[[https://drive.google.com/open?id=1MAks9njNpjYZCYx-XmxYGSjFNdm8EeSX|video2]],[[https://drive.google.com/open?id=10g31aJvRBczMFA2g_hZv7vUCrheKMzwg|video3]],[[https://drive.google.com/open?id=1AwFNY1FFgP6HE_55ls_Ate0rgTqgAHiC|video4]])\\
-4. //Amortized Analysis// ({{cs500d.pdf|pdf}},{{cs500d.ppt|ppt}},**[[https://drive.google.com/open?id=1ScSI1k8LWqexjZW9t-NVADmkBEkkx_u1|video1]],[[https://drive.google.com/open?id=1dXuo6Qy_zhKZB5CB320ZPYSOKIf_Xpz4|video2]],üühttps://drive.google.com/open?id=1I20QcE3ppNFYpueV47832UOdWEYYdi3F|video3]]**) \\ +4. //Amortized Analysis// ({{cs500d.pdf|pdf}},{{cs500d.ppt|ppt}},**[[https://drive.google.com/open?id=1ScSI1k8LWqexjZW9t-NVADmkBEkkx_u1|video1]],[[https://drive.google.com/open?id=1dXuo6Qy_zhKZB5CB320ZPYSOKIf_Xpz4|video2]],[[https://drive.google.com/open?id=1I20QcE3ppNFYpueV47832UOdWEYYdi3F|video3]],[[https://drive.google.com/open?id=1kzCI3aZRgnAYVlul_Y3xB86_N9IXUj4j|video4]],[[https://drive.google.com/open?id=1H0OYvUSLpNzpJns1ZYtfuBoyWqLSj_FU|video5]]**,[[https://drive.google.com/open?id=1TMfMLh96Emj1wVGueUwKY9Y8GunsvMle|bonus]]) \\ 
-5. Randomization \\ +5. Randomization ({{cs500e.pdf|pdf}},{{cs500e.ppt|ppt}},[[https://drive.google.com/open?id=17deQGbAV9I7NnqJBceNCFaBnjxrEOTDb|video1]],[[https://drive.google.com/open?id=1Wl7QF59KOZWaF4QqSkBou8-J_5TDIwmN|video2]],[[https://drive.google.com/open?id=13FUGxBgdibUBQeTzo66m4SIvqMABmGTz|video3]])\\ 
-6. Online/Competitive \\ +6. Online/Competitive ({{cs500f.pdf|pdf}},{{cs500f.ppt|ppt}},[[https://drive.google.com/file/d/1XFqPYSxmseGHHUPjR7t_hpT3wgoRe-_O/view|video1]],[[https://drive.google.com/file/d/1K-Bf9sB_vUkPtgJ061Tgdeot0iqgJ1I6/view|video2]],[[https://drive.google.com/file/d/1trSVJfBizqQPWrG2g7L7MdS-G2CvBNaR/view|video3]])\\ 
-7. Complexity Theory \\ +7. Complexity Theory ({{cs500g.pdf|pdf}},{{cs500g.ppt|ppt}},[[https://drive.google.com/file/d/1DnKY5hEnQ2r8wPiuf9e-ez_wDl2Jjx2m|video1]],[[https://drive.google.com/file/d/1oCjyjvqE7sbuzK5V9z_kS_xzxUNuJvOg/view|video2]])\\ 
-8. Approximation \\ +8. Approximation ({{cs500h.pdf|pdf}},{{cs500h.ppt|ppt}},[[https://drive.google.com/file/d/14wPQquK6Mhh-qeDohkHGZC7ObQRywOZt/view|video1]],[[https://drive.google.com/file/d/12dR1dXHxJPrSo2KksV6B3AspZE1-R6F9/view|video2]],[[https://drive.google.com/file/d/1gWtMmEptPDJSyDjyZ9ctiBDPgkRjakoa/view|video3]]) \\ 
-9. Memory≈parallel Time \\ +(9. Memory≈parallel Time) \\ 
-10. Conclusion +10. Conclusion ({{cs500j.pdf|pdf}},{{cs500j.ppt|ppt}})
  
 ==== E-Learning: ==== ==== E-Learning: ====
   * [[http://klms.kaist.ac.kr/course/view.php?id=114651/|KLMS]]   * [[http://klms.kaist.ac.kr/course/view.php?id=114651/|KLMS]]
   * [[https://kaist.elice.io/courses/3037|ELICE]]   * [[https://kaist.elice.io/courses/3037|ELICE]]