Date

Monday, December 14th

Time

7–10p

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 Siebel 1214 because my last name (Tolar) starts with T.

Last Name	Room
A	SIEBL 1111
B	ECEB 1002
C	DCL 1310
D	SIEBL 1109
E	SIEBL 1302
F	SIEBL 1304
G	ECEB 1002
H	SIEBL 1105
I	SIEBL 0216
J	SIEBL 1131
K	SIEBL 1404
L	ECEB 1013
M	ECEB 1002

Last Name	Room
N	SIEBL 1404
O	ECEB 1013
P	ECEB 1002
Q	ECEB 1013
R	SIEBL 1404
S	ECEB 2017
T	SIEBL 1214
U	ECEB 1013
V	SIEBL 1304
W	SIEBL 0216
X	SIEBL 1103
Y	SIEBL 1302
Z	SIEBL 1404

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.
• The few coding questions that will be on the exam will come from MP6 & 7, and also from the lab exercises. Make sure you can do all that coding.

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