FINAL EXAM HINTS

WHEN : 		Thursday, December 16, 1100AM - 0150PM. 
WHERE : 	 	HH253. 
FORMAT : 
(i) 	Four problems, cummulative. One problem will cover the pre-midterm material. Three problems will cover post-midterm material.
(ii) 	Problem 1. Format : "Given the following implementation for the data structure ??? (i.e. heap, binary search tree, AVL tree, collection (array/list), stack (?/?), queue (?/?), ...), provide the implementation for the ??? (i.e. peekMin, intersection, counter, ...) operation given the following prototype ??? (method signature)."  	35-40 points. 
(iii)	Problem 2. and 3. Format : "Given the data structure ??? and algortihm ??? for doing ???, trace by hand and show all the relevant phases during its execution (as demonstrated in examples given in class) and ??? ..."	15-20 points. 
(iv) 	Problem 4. Format : "Given the following algorithm for ???, provide its time complexity and justify the answer by doing an analysis of it." 	25-30 points. 
GRADING : 
(i) 	Partial credit is given. The amount of points given depends on the closeness to the complete solution to the problem. 
(ii) 	Incorrect extras are penalized. 
(iii) 	There will be multiple groups of questions. 
(iv) 	The correct solution set with your graded exams will be provided for the next class. 
(v) 	There will be no make up exam.