This website is preserved for historical and scholarly reference and is no longer actively maintained.
Tentative Class Schedule
CP SC 241 Section 2
-- 8:00 a.m. Monday Wednesday Friday -- 415 Daniel
Data Structures and Algorithm Analysis in Java by Mark Allen Weiss
January 10, 12: Chapter 1 (Introduction)
January 15: no class (Martin Luther Day)
January 17, 19: Chapter 3 pages 55-75 (Lists)
January 22, 24: Chapter 2 (Algorithm Analysis)
January 26: Chapter 3 pages 75-88 (Stacks)
January 29: Chapter 3 pages 88-94 (Queues)
January 31, February 2: Chapter 4 pages 99-118 (Binary Trees, Binary Search Trees)
February 5, 7, 9: Chapter 4 pages 118-130 (AVL Trees) / possibly extend to include Splay Trees
February 12, 14, 16: remainder of Chapter 4 (B-Trees)
Monday, February 19: Hour Quiz 1 (Chapters 1 through 4)
February 21, 23: Chapter 5 pages 155-162 (Hashing, Open Chaining)
February 26, 28, March 2: remainder of Chapter 5 (Open Addressing)
March 5, 7, 9: Chapter 6 (Priority Queues)
March 12, 14: Chapter 7 (Disjoint Set ADT)
Marsh 16: Hour Quiz 2 (primarily Chapters 5, 6, 8, but other chapters included)
SPRING BREAK
March 26: begin Chapter 9
March 28: Kruskal's Algorithm for Minimum Spanning Tree
March 30: Topological Sort
April 2, 4, 6: Shortest Distance Algorithms, including Disjkstra
April 9: Prim's Algorithm for Minimum Spanning Tree
April 11: Depth-first Search
April 13, 16, 18: NP-complete
Friday, April 20: Hour Quiz 3 (primarily Chapter 9, but other material not excluded)
April 23, 25, 27: Chapter 7 (Sorting)
Exams
Some topics will be covered that are not in the text. Please get the notes and assignments from other students (or the web, when appropriate) so that you will be prepared for class at all times. Being absent is not an excuse for being unprepared for material covered in the previous class. Nor is being absent an excuse for being unprepared to turn in assignments.