CS300 Algorithms2010 Spring Semester |
|
Instructor :
Sunghee Choi
(Office : E3-1 3430,
Tel : x3534)
TA : -Donghoon Shin (x5574) Class Time : Monday/Wednesday 12:30-14:00 Location : Classroom 1 (Room #1101) Textbook : Introduction to Algorithms, 3rd Edition by Cormen, Leiserson, Rivest, Stein The MIT Press Mid-term : March, 26 (Fri.) 13:00~16:00, Room#1501 (in front of the classroom), E3-1 1 A4 hand-written cheat sheet is allowed. (3월 26일(금) 13:00~16:00, 1501호 제1공동강의실, E3-1) A4 한 장에 필요한 내용을 손으로 적어 오실 수 있습니다. Homework : Homework box on the 1st floor Homework 1 (Due 2/12(Fri.) 23:59 PM) pdf sol Homework 2 (Due 2/22 12:25 PM) pdf sol Homework 3 (Due 3/3 12:25 PM) pdf sol Homework 4 (Due 3/15 12:25 PM) pdf sol
Leture note: Intro pdf Recurrence pdf Divide and conquer pdf Random pdf Quick sort pdf Heap pdf Linear sort pdf Selection pdf Hashing1 pdf Hashing2 pdf Amortized Analysis (Ch 17) pdf Dynamic Programming (Ch 15) pdf Dynamic Programming (LCS problem) pdf Greedy Algorithms (Ch 16) pdf Minimum Spanning Trees (Ch 23) pdf Graph Algorithms (Ch 22) pdf Shortest Paths I (Ch 24) pdf Shortest Paths II pdf All Pairs Shortest Paths (Ch 25) pdf NP-completeness (Ch 34) pdf |