CMSC-341 Fall 2001
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
- IntCell.H
- IntCell.C
- IntCell.C (continued)
- TestIntCell.C
- MemCell.H
- MemCell.C
- MemCell.C (continued)
- TestMemCell.C
- 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
-
Stacks and Queues
- Trees Module
-
Introduction to Trees
-
Binary Search Trees
- Heaps and Priority Queues Module
-
Priority Queues and Heaps
- Hashing Module
-
Hashing
- Balanced BST Module
-
Introduction to Splay Trees notes (PostScript) - Anastasio
- Splay Trees (ppt)
- Introduction to Red-Black trees
(PostScript)
PDF - Anastasio
-
Red-Black Tree (1) -- PPT Frey
-
Red-Black Tree (2) -- PPT Frey
-
Red-Black Tree (3) -- PPT Frey
-
Red-Black Tree (4) -- PPT Frey
- 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
- 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
- Disjoint Set Module
-
Notes from the 1994 SRC Algorithm Animation Festival
-
Ackerman Function notes (html) by Robert Kosara
- Disjoint Set Notes PPT slides
- Graph Module
- Intro to Graphs
- More Graphs
- Yet More Graphs