- March 26 (Problem Solving - pg. 3-21)
- March 28 (Introduction to Abstract Data Types - pg. 105-125)
- March 30 (Recursive Solutions - pg. 50 - 80, optional: pg. 216-220) example1 example2
- April 02 & 04 (Lists - 1 - pg. 125-134)
- April 06 (Lists - 2 - pg. 148-170, 190-197)
- April 09 & 11 (Stacks - pg. 250-272, 272-289)
- April 13 (Queues - pg. 303-324)
- April 16 (Introduction to Sorting - pg.391-409)
- April 18 (Sorting: Insert Sort. Shell Sort - pg. 409-411 and ...)
Shell Sort Example
- April 20 (Sorting: Quick Sort, merge Sort - pg. 412 - 427)
Sorting Algorithms Comparison
- April 23: Review, Others
- April 25: Midterm, Pb7 Solutions
- April 27 (Next HW explanation, Exceptions - pg. 343-387 and ...)
- April 30 (Exceptions, Introduction to Trees)
- May 02 (Trees) Examples- Expression Trees
- May 02- tutorial
- May 04 (Binary Search Trees) Binary Search Trees
- May 07 (AVL Trees, Splay Trees)
- May 09 (2-3,2-3-4 Trees, B-Trees)
- May 11 (Tables, Priority Queues) Examples
- May 14 (Hashing) Hash Example
- May 16 (Disjoint Set)
- May 18 (Introduction to Graphs. DFS) Graph Implementation using Binary Search Trees
- May 21 (DFS, BFS, Topological Sorting)
- May 23 (Minimal Spanning Tree, Shortest Path)
- May 25 (External Methods)
- May 30 (Exam Review, Optional reading)
- June 8 (Final Exam: 8-10)
