CMSC-341 Fall 2000

Lecture Materials

Disclaimer: Lecture materials are not guaranteed to contain everything of importance in class. Sometimes this is because they were prepared by another instructor than yours. Sometimes this is just because important things can happen spontaneously. You are responsible for whatever happened in your section, whether you were there or not.
Slides for C++ Module
Notes from Lecture 1
Notes from Lecture 2
Notes from Review Section

Asymptotic Analysis Module
  Asymptotic Analysis notes
  More Asymptotic Analysis notes

List Module
  Intro to Lists, Iterators
  Linked List Implementation
  More Linked List Implementation

Stacks/Queues Module
  Stacks and Queues

Hashing Module
More Hashing

Balanced BST Module
Intro to Balanced Trees; Splay Trees
Splay Trees
Splay Tree notes (PostScript) - Anastasio
Intro to Red-Black Trees
More Red-Black Trees
Yet More Red-Black Trees
Still Yet More Red-Black Trees
Intro to Balanced Trees; Splay Trees PostScript   PDF - Anastasio

B-Tree Module
B-Tree Lecture

Heaps and Priority Queues Module
Intro to Priority Queues
More Priority Queues

Graph Module
Intro to Graphs
More Graphs
Yet More Graphs

SkipList Module
Anastasio's SkipList notes     

Last modified on Monday December 4, 2000 (14:46:44 EST) by Penny Rheingans