419.206 Data Structures (Spring 1997)
Department of Computer Engineering, Seoul National University
- Instructor: Prof. Byoung-Tak Zhang
- Classroom: 301-203
- Time: Mon / Wed / Fri 9–10 am
Textbook
- Fundamentals of Data Structures in C++ — E. Horowitz, S. Sahni & D. Mehta — Freeman and Company — 1995
Course Schedule
| Week | Topic |
|---|---|
| 1 | Introduction |
| 2 | Analysis of Algorithms |
| 3 | Arrays, Polynomials |
| 4 | Sparse Matrices, Strings |
| 5 | Stacks and Queues |
| 6 | Evaluation of Expressions |
| 7 | Multiple Stacks and Queues |
| 8 | Midterm Exam |
| 9 | Singly Linked Lists, Circular Lists |
| 10 | Doubly Linked Lists, Generalized Lists |
| 11 | Binary Trees, Tree Traversal |
| 12 | Threaded Binary Trees, Heaps |
| 13 | Selection Trees, Forests |
| 14 | Graphs, Minimum Spanning Trees |
| 15 | Shortest Paths, Activity Networks |
| 16 | Final Exam |