Data Structures Laboratories for Spring 2019
|
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 |
Divide-and-Conquer vs. Dynamic Programming |
||
|
7 |
March 6 |
Dictionary/Map Implementations using hashing and their performance |
||
|
8 |
March 13 |
Sorting |
||
|
9 |
March 27 |
Binary Search Trees |
||
|
|
April 3 |
No new lab – Catch-up session |
|
|
|
10 |
April 10 |
AVL put Implementation |
||
|
11 |
April 17 |
Graph implementation and traversal |
||
|
12 |
April 24 |
Graph Algorithms: Prim's and Dijkstra’s |
||
|
|
May 1 |
No new lab - Catch-up session |
|
|
|
|
|
Finals Week – No Lab |
|
|