CMSC-341, Fall 1999, Section 0101
Lecture Materials
- Slides for Lectures 1 and 2 -- C++ and Templates
- IntCell.H
- IntCell.C
- IntCell.C (continued)
- TestIntCell.C
-
- MemCell.H
- MemCell.C
- MemCell.C (continued)
- TestMemCell.C
- Asymptotic Analysis Module
-
Asymptotic Analysis notes from CMSC-202 (html)
-
Asymptotic Analysis Dr. Aanastasio's notes (Postscript)
- Lists
-
- List ADT
- ListNode.H
- ListNode.C
- List.H
- List.C
- ListItr.H
- ListItr.C
- Stacks, and Queues
Note: code available at
/afs/umbc.edu/users/a/n/anastasi/pub/CMSC-341/Lectures/StackQueue
- Stack.H
- Stack.H(cont'd)
- Stack.H(cont'd 2)
- Stack.C
- Stack.C(cont'd)
- Stack.C(cont'd 2)
- Stack.C (cont'd 3)
- Stack.C (cont'd 4)
Look for (uncompiled and untested) .C and .H files in
this directory
- Binary Search Trees
- Tree Preliminaries
- Binary Tree
- Binary Search Trees
- Binary Nodes
- BST.H (part 1 of 2)
- BST.H (part 2 of 2)
- BST find ( )
- BST insert ( )
- BST remove ( )
- BST makeEmtpy ( )
- Hashing
- Hashing Functions
- Text Figure 5.4
- Mr. Edelman's notes on
mulitplicative hashing
- A nice graph of
Fibonacci Hashing distribution
- Priority Queues
- Priority Queues
- Binary Heap class
- findMin ( )
- insert ( )
- deleteMin ( )
- Building a Binary Heap
- Leftist Heaps
- Balanced Binary Search Trees
- AVL Trees (Dr. Anastasio)
- AVL code from the author
- AvlNode.h
- AvlTree.h
- AvlTree.cpp
- AvlSingleRotate.cpp
- AvlDoubleRotate
- Red-Black Trees (Dr. Anastasio - PostScript)
- R-B top-down insert diagrams (Dr. Anastasio)
- Splay Trees (Dr. Anastasio - PostScript)
- Skip Lists
-
Skip List Notes (Dr. Anastasio - Postscript)
-
Skip List Paper (Dr. Wm Pugh -- PDF format)
-
Skip List 'C' code (Dr. Wm Pugh)
- Comparison
of SkipLists and B-Trees by Michael D. Black (html)
- B-Trees
- B-Tree notes by Dr. Anastasio (postscript)
- Comparison
of SkipLists and B-Trees by Michael D. Black (html)
- Paper on
Deletion in B-trees (Jan Jannick -- PostScript)