Data Structures Laboratories for Spring 2013
Lab # |
Date |
Description |
Files |
Handouts |
---|---|---|---|---|
1 |
Jan 16 |
Python Review |
||
2 |
Jan 23 |
Big-oh |
||
3 |
Jan 30 |
Queue Implementations |
||
4 |
Feb 6 |
Priority Queue Implementations |
||
5 |
Feb 13 |
Recursion |
||
|
Feb 20 |
No new lab - Catch-up session |
|
|
6 |
Feb 27 |
Backtracking vs. Dynamic Programming |
||
7 |
Mar 6 |
Dictionary/Map Implementations using hashing and their performance |
||
8 |
Mar 13 |
Sorting |
||
|
Mar 20 |
Spring Break – No Lab |
|
|
9 |
Mar 27 |
Binary Search Trees |
||
|
Apr 3 |
No new lab – Catch-up session |
|
|
10 |
Apr 10 |
AVL put Implementation |
||
11 |
Apr 17 |
Graph implementation and traversal |
||
12 |
Apr 24 |
Graph Algorithms: Prim's and Dijkstra’s |
||
13 |
May 1 |
No new lab - Catch-up session |
|
|
|
May 8 |
Finals Week – No Lab |
|
|