Data Structures Laboratories for Spring 2012
|
Lab # |
Date |
Description |
Files |
Handouts |
|---|---|---|---|---|
|
1 |
Jan 11 |
Big-oh analysis and timings |
||
|
2 |
Jan 18 |
Simple sorts: timings and code questions |
||
|
3 |
Jan 25 |
Classes, documentation, and Unit testing |
||
|
4 |
Feb 01 |
Top-Down design practice |
|
|
|
5 |
Feb 08 |
Queue Classes |
||
|
|
Feb 15 |
No new lab - Catch-up session |
|
|
|
6 |
Feb 22 |
Positional List Implementations |
||
|
7 |
Feb 29 |
Priority Queue Implementations |
||
|
8 |
Mar 07 |
Backtracking vs. Dynamic Programming |
||
|
9 |
Mar 21 |
BST Implementations |
||
|
|
Mar 28 |
No new lab - Catch-up session |
|
|
|
10 |
Apr 04 |
Dictionary Implementations using hashing and their performance |
||
|
11 |
Apr 11 |
B+ Tree worksheet |
|
|
|
12 |
Apr 18 |
Graph implementation and traversal |
||
|
13 |
Apr 25 |
TBA |
||
|
|
May 02 |
Finals Week – No Lab |
|
|