Introduction to Computing Laboratories for Spring 2009
|
Lab # |
Date |
Description |
Files |
Handouts |
|---|---|---|---|---|
|
1 |
5/12 |
Big-oh notation and searching |
||
|
2 |
5/12 |
Divide-and-Conquer vs. Dynamic Programming |
|
|
|
3 |
5/19 |
Design, Documentation, and Testing in Python |
||
|
4 |
5/19 |
Stack Implementations: List, Array, and Linked Representations |
||
|
5 |
5/26 |
Queue Implementations: Array and Linked Representations |
||
|
6 |
5/26 |
Priority Queue Implementations: Linked and Heap (list) Representations |
||
|
7 |
6/2 |
Positional List: Linked Representations |
||
|
8 |
6/23 |
Recursive Backtracking programs |
||
|
9 |
6/23 |
BST Implementation |
||
|
10 |
6/30 |
AVL Tree Implementation |
||
|
11 |
7/7 |
Hash Tables |
||
|
12 |
7/14 |
Graph Traversals and Algorithms |