Data Structures Laboratories for Fall 2010
Lab # |
Date |
Description |
Files |
Handouts |
---|---|---|---|---|
1 |
Aug 25 |
Algorithm Complexity Analysis, and Linear Search |
||
2 |
Sep 01 |
Simple Sorts |
||
3 |
Sep 08 |
Recursion, divide-and-Conquer vs. Dynamic Programming |
|
|
4 |
Sep 15 |
Stack performance |
||
5 |
Sep 22 |
FIFO Queue Implementations |
||
|
Sep 29 |
No New Lab – catch-up session |
|
|
6 |
Oct 06 |
Priority Queue Implementations |
||
7 |
Oct 13 |
Advanced Sorting Algorithms |
||
8 |
Oct 20 |
Recursive Backtracking and Dynamic Programming – Coin Change Problem |
||
9 |
Oct 27 |
BST remove method implementation |
||
|
Nov 03 |
No New Lab – catch-up session |
|
|
10 |
Nov 10 |
AVL add method implementation |
||
11 |
Nov 17 |
Hashing Performance and implmentations |
||
|
Nov 24 |
NO LAB – THANKGIVING BREAK |
|
|
12 |
Dec 01 |
Graph traversals |
||
13 |
Dec 08 |
No New Lab – catch-up session |
|
|