Lecture Materials

Disclaimer: Lecture materials are not guaranteed to contain everything of importance in class. Sometimes this is because they were prepared by an instructor other 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
IntCell and MemCell  (PPT)
IntCell and MemCell  (PDF)

Asymptotic Analysis Module
Asymptotic Analysis notes (postscript)   (html)
More Asymptotic Analysis notes (PPT)

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

Stacks/Queues Module
Deques, Stacks and Queues

Recursion Module

Trees Module
Introduction to Trees
Binary Search Trees

Balanced BST Module
Introduction to Splay Trees notes (PostScript) - Anastasio
Splay Trees (ppt)

Introduction to Red-Black trees (PostScript)   PDF - Dr. Tom Anastasio
Red-Black Tree (1) -- PPT
Red-Black Tree (2) -- PPT
Red-Black Tree (3) -- PPT
Red-Black Tree (4) -- PPT

Hashing Module

Heaps and Priority Queues Module
Priority Queues and Heaps
Binomial Queues and Fibonacci Heaps

SkipList Module
Anastasio's SkipList notes PostScript   and   HTML
Mr. Frey's PowerPoint version of Dr. Anastasio's notes
SkipList paper by Wm. Pugh (PDF format)
SkipList C code by Wm. Pugh

Disjoint Set Module
Notes from the 1994 SRC Algorithm Animation Festival
Ackerman Function notes (html) by Robert Kosara
Disjoint Set Notes PPT slides

B-Tree Module
Paper on deletion in B-trees by Jan Jannink (Postscript)
Dr. Anastasio's Btree Notes PostScript PDF
Mr. Frey's PowerPoint version of Dr. Anastasio's Btree Notes

Last modified on Monday November 24, 2003 (13:14:19 EST) by Dennis Frey
email: frey@cs.umbc.edu

Back up to Spring 2003 CMSC-341 Homepage