These objectives are pursued by implementing the data structures and algorithms discussed. A course on advanced data structures and an introductory treatment of the design, analysis, and complexity of algorithms. Covers B-trees, hash tables, heaps, and advanced sorting algorithms. Explores fundamental algorithm design techniques and basic graph algorithms. There will be several assignments and three exams.
All exams are closed book unless announced otherwise.
Covers all materials before the exam. Covers all materials after the first exam. Covers all materials after the second exam. All assignments are due at the beginning of class. No late submission is allowed.