Final Review
Logistics
- Thursday, May 5th from 8:00 a.m. - 9:50 a.m. in EPS 103.
- You may bring two 8.5 by 11 sheets of two-sided notes.
- You may bring a non-programmed calculator.
- The exam is comprehensive.
- The exam will have approximately a 2/3 emphasize on
the material since the midterm.
Finals Week Office Hours
- Tuesday, May 3rd from 9 a.m. - 11 a.m.
Advice
- The test will be designed to examine your comprehension of
the subject material, not your memorization skills.
- Try to get a good night's sleep the night before.
Second Half Small Topics
Second Half Big Topics
- Recursion
- Searching: Binary, Sequential
- Sorting: Insertion, Selection, Bubble, Shell, Merge, Heap, Quick
- The Queue ADT and its Underlying Implementations
- The Priority Queue ADT and its Underlying Implementations
- Statement Counts, Time Complexity and Big O Notation
- Empirical Studies
Important Library Classes
- java.util.Queue Interface
- java.lang.Comparable Interface
- java.util.Arrays
- java.util.Scanner
- java.util.Formatter
First Half Topics
Please refer to the midterm review.
Types of Questions
- Select and justify an appropriate search technique for a problem.
- Select and justify an appropriate sorting technique for a problem.
- Select and justify an appropriate ADT for a problem.
- Conduct an empirical investigation and interpret the results.
- Write code to solve a problem
- Given code, tell what it does
- Given code, amend it to do something new
- Given faulty code, fix it to work properly
- Given code, calculate statement counts and time complexity
- Prove a statement count has a certain time complexity
- Answer a conceptual question