Study guide for the Final
Phillip G. Bradford
Phillip.bradford@uconn.edu
2019-12-05
1. All exams are closed-book, closed-notes, No computer, no calculator and no other electronic equipment for use with the exam.
2. Coverage
a. All work covered by prelim 1 and prelim 2.
b. Merge sort
c. More on binary search trees
d. Heaps
e. Stacks
f. Queues
g. Mutation and state change
h. Dispatch
i. Streams
j. Vectors