CS 14: Introduction to Data Structures and Algorithms

Fall Quarter 2002: September 23, 2002 - December 6, 2002

Schedule (Tentative)

The links to individual lectures do not work right now since there are no lecture notes for the course yet. Sorry! Note the word tentative above! There will be changes to the schedule to accomodate the actual progress we make.

Date Topic Homework Lab Examination
September 26 Introduction and Overview - Lab 0 Quiz 0
October 1 Arrays, Abstract Data Types, Complexity - - -
October 3 Arrays, Toolchain, C++ Implementation Assignment 1 - -
October 8 Variables & Flexible Arrays, Intro to Lists - Lab 1 -
October 10 Functional Lists, C++ Implementation Trouble - - Quiz 1
October 15 Lists, Positions, Complexity, Iterators (Strike) Assignment 2 - -
October 17 C++ Implementation, Intro to Trees - - -
October 22 More Terminology, ADT Binary Trees - Lab 2 Quiz 2
October 24 Array Iterators, Tree Traversals, Compilers - - -
October 29 Midterm Examination - - Midterm
October 31 Reference Counting, Tree Implementation Assignment 3 - -
November 5 Stacks, Queues, and Deques - Lab 3 Quiz 3
November 7 Positions vs. Values, Sets, Heaps - - -
November 12 Heaps, Sorting Problem, Bubble Sort Assignment 4 - -
November 14 Selection Sort, Heap Sort, Lower Bounds - - -
November 19 Data Compression, Huffman Codes - Lab 4 Quiz 4
November 21 Maps, Hash Tables - - -
November 26 Hash Tables, Binary Search Trees - - -
November 28 Thanksgiving, No Lecture! Assignment 5 Lab 5 -
December 3 Binary Search Trees - - Quiz 5
December 5 Outlook and Review - - -
December 10 Final Examination - - Final
Copyright © 2002 Peter H. Fröhlich. All rights reserved.
$Id: schedule.html,v 1.18 2002/11/30 04:46:58 phf Exp $ 		Valid XHTML 1.1!