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