Lecture #19 ==================
FINAL EXAM!!!!!
Final Exam Review

Lecture #18 ==================
Dynamic Programming

Final Exam Review

Slides

Lecture #17 ==================
Dynamic Programming

Slides

Lecture #16 ==================
Hash Tables, Part 2

Slides

Lecture #15 ==================
Hash Tables, Part 1

Slides

Lecture #14 ==================
Minimum Spanning Tree

Hash Tables: Mauricio, Jeff

Slides

Lecture #13 ==================
Floyd-Warshall; Minimum Spanning Tree

Minimum Spanning Tree: Ali

Slides

Lecture #12 ==================
Midterm Exam

Slides

Lecture #10 ==================
Graphs - Dijkstra's Algorithm, Floyd-Warshall

Floyd-Washall: Duggan's Presentation

Slides

Lecture #9 ==================
Graphs - Basic, BFS/DFS

Dijkstra's: RJ's Presentation

Slides

Lecture #8 ==================
B-Tree Insert, Delete (Overview)

BFS: Ali's  Presentation

Slides

Lecture #7 ==================
B-Tree Basics, Insert
Skip Lists: Mauricio, Dale

Wikipedia article: BTrees

Slides

Lecture #6  ==================
Heapsort (finished, exercises)
RJ & Nathan's  BTree Slides

Slides

Lecture #5  ==================
MergeSort
Jeff & Joe's  Mergesort Slides

Preview: MergeSort

MergeSort: By Hand (Time Diagram)
      Time Diagram Example (Excel)

Implementing MergeSort
      Western Kentuckey U Sample

HeapSort
Heapsort Exercises

Slides 

Lecture #4 (AVL-Remove)  ======
Exercises
Slides 

Lecture #3   =================
<Canceled due to snow) 

Skip Lists
Skip Lists
    NIST definition
    Overview
    Demo Applet
   Original (?) Paper