Date

May 09, 2016

Time

1:30-4:30pm

Practice

• sp10
• fa09
• sample1
• sample2
• su05 solution
• sample1 solution
• sample2 solution

Location

Please see the table below—go to the room based on the first letter of your last name. For example, I would go to ECEB 1002 because my last name (Tolar) starts with T.

Last Name	Room
A	SIEBL 1109
B	ECEB 1002
C	DCL 1310
D	ECEB 1002
E	SIEBL 1404
F	DCL 1320
G	ECEB 1002
H	DCL 1320
I	SIEBL 1105
J	ECEB 1002
K	SIEBL 1105
L	SIEBL 1404
M	DCL 1320

Last Name	Room
N	DCL 1310
O	SIEBL 0216
P	ECEB 1002
Q	SIEBL 1109
R	ECEB 1002
S	SIEBL 0216
T	ECEB 1002
U	SIEBL 1404
V	ECEB 1002
W	SIEBL 1404
X	SIEBL 1404
Y	ECEB 1002
Z	DCL 1320

Final Exam Study Suggestions

• Make a list of all of our data structures.
• Make sure you understand the basic function of each. (Is it a special purpose structure or a dictionary?)
• Make sure you understand the implementation issues for each. (Why is it ok to store a heap in an array, but we can’t do that for an AVL tree?)
• Make sure you understand the running times of each of the basic functions. (For most, this means the running time of remove, insert, and find).
• Spend a fair amount of time on graph implementations, making sure you understand the tradeoffs between adjacency lists and arrays, and why each of those is better than just an edge list.
• We did the following graph algorithms: traversals — DFS & BFS, MST — Prim’s & Kruskal’s. Make sure you understand running times and implementations of each.

We strongly suggest you get together with 2 other people and just crank through the material mentioned above.