CSE 331 -- Data Structures -- Fall 2004
Lecture Schedule (latest revision 9/2/2004)
- WEEK 1: Aug 23 - 27
- Ch 1: Introduction to Data Structures: ADTs, C++ Classes & APIs
- Ch 2: Software Design, Exceptions, and Object Composition
- WEEK 2: Aug 30 - Sep 3
- Ch 2&3: Operator overloading, Algorithms (Selection Sort & Binary
Search)
- Ch 3&15: Template functions, Recursive Algorithms (permute, fib & 8queens)
- WEEK 3: Sep 6 - 10
- Ch 4: STL & Template classes, Vectors, Insertion Sort
- Ch 15: More sorting (Quicksort & Mergesort)
- WEEK 4: Sep 13 - 17
- Linux & g++, make, Mandelbrot Sets & Images (not in text)
- Ch 5: Pointers & Dynamic Memory (Quick Review)
- WEEK 5: Sep 20 - 24
- Ch 6: Ncurses I/O, the List Container & iterators
- Ch 7: Stacks
- WEEK 6: Sep 27 - Oct 1
- Ch 8: Queues, Priority Queues, Radix Sort, ...
- Ch 8: Queue Implementation, Simulation
- WEEK 7: Oct 4 - 8
- Ch 8: Linked Lists & Review
- Ch 9: Midterm Exam (in class) -- THIS IS A CHANGE!!
- WEEK 8: 11 - 15
- Ch 9: Doubly linked lists
- Ch 10: Binary trees
- WEEK 9: Oct 18 - 22
- MID SEMESTER BREAK
- MID SEMESTER BREAK
- MID SEMESTER BREAK
- WEEK 10: Oct 25 - 29
- Ch 10: Binary Search trees
- Ch 11: Intro to Associative containers (sets)
- WEEK 11: Nov 1 - 5
- Ch 11: Maps and multisets
- Ch 12: Hashing and tables
- WEEK 12: Nov 8 - 12
- Ch 12: 2-3-4 and red-black trees
- Ch 14: Heaps & Heapsort
- WEEK 13: Nov 15 - 19
- Ch 14: Graphs
- Ch 16: Graphs searches & traversals
- WEEK 14: Nov 22 - 26
- String Mathing and/or more on Graphs
- THANKSGIVING BREAK
- WEEK 15: Nov 29 - Dec 3
- Project Presentations
- Project Presentations
- WEEK 16: Dec 6 - 10
- Project Presentations
- READING DAY
- EXAM (Monday, 12/13/2004, 10:30AM - 12:30PM
Page maintained by John H Stewman
Last modified: 9/2/2004