code:
4190.204_2006F
level:
year:
term:
staff:
Prof. KIM, HYOUNG JOO
c_regdate:
2007-05-18 14:46:03
department:
Data Structures
coursetab
| c_weekno | Title | Body |
|---|---|---|
| Ch0 | Warming-Up and Course Introduction | |
| Ch1 | Java Review | |
| Ch11 | Skip Lists and Hashing | |
| Ch12 | Binary and Other Trees | |
| Ch13 | Priority Queues | |
| Ch14 | Tournament Trees | |
| Ch15 | Binary Search Trees | |
| Ch16 | Balanced Search Trees | |
| Ch17 | Graphs | |
| Ch18 | The Greedy Method | |
| Ch19 | Divide and Conquer | |
| Ch2 | Performance Analysis | |
| Ch20 | Dynamic Programming | |
| Ch21 | Backtracking | |
| Ch22 | Branch and Bound | |
| Ch3 | Asymptotic Notation | |
| Ch4 | Performance Measurement | |
| Ch5 | Linear Lists -- Array Represenatation | |
| Ch6 | Linear Lists -- Linked Representation | |
| Ch7 | Linear Lists -- Simulated Pointers | |
| Ch8 | Arrays and Matrics | |
| Ch9 | Stacks |