FULL INDEX:
SLIDES & Examples:
[in alphabetical order]
Load to Left Frame
Big Picture [Slide]
Binary File, Read [C++ Code]
Binary File, Write [C++ Code]
Binary I/O [C++ Code]
Binary Tree, Paged [Slide]
Ring Files [Slide
1
2
]
Tries [Slide
1
2
3
4
]
UNIX, Inodes [Slide]
UNIX, Links [Slide]
B*Trees:
Example [Slide
1
2
3
4
5
6
]
B+Trees:
Building an Index [Slide]
Deleting a Block [Slide]
DEMO [demo]
Insertion - New Key [Slide]
Insertion - No Change [Slide]
Insertion -Change Key [Slide]
Separators [Slide]
Simple Prefix B+Tree [Slide]
Splitting a Block [Slide]
Example [Slide
1
2
3
4
5
6
7
8
]
BTrees:
Add a Node [Slide]
Insertions [Slide
1
2
]
Deletion Examples [Slide
1
2
3
4
5
]
Insertion Examples [Slide
1
2
3
4
5
6
7
8
9
10
]
Pseudocode [ Pseudocode]
Cosequential Processing:
2-Way Intersection [Slide]
Balanced Merge [Slide]
Heap Sort [Slide]
Merge w/o Duplication [Slide]
Polyphase Merge [Slide]
Replacement Selection Sort [Slide
1
2
3
4
5
6
]
Selection Tree [Slide]
Sort Merge [Slide
1
2
3
4
5
6
7
8
9
10
]
Tape Merge [Slide]
Tournament Tree [Slide]
Data Compression:
Huffman Codes [Slide
1
2
3
4
5
]
LZ77 [Example]
LZ78 [Example]
LZW [Example]
Hard Drive
Hard Drive [Slide]
Hard Drive vs CD-ROM [Slide]
Cylinders [Slide]
Placement of Information [Slide]
Hardware Calculations [Examples]
Hashing:
Binary Tree Insertion [Example]
Blank Table [Example]
Brent's Method [Example]
Chaining Comparison [Slide]
Collision Resolution, Build Table [C++ Code]
Collision Resolution, Search Table [C++ Code]
Computed Chaining [Example]
Deletion Algorithm [Slide]
Double Hashing [Example]
Dynamic - Spiral Storage [Slide]
