CS 1713 Introduction to Computer Science
Fall 2009 Final Exam Information

The final exam will last 150 minutes and consist of questions worth a total of 100 points.
Do not spend more than 1 minute per point when making a first pass through the exam.
This will give you time to go back to the harder problems.
Most likely, the exam will contain the following types of problems.
Point values are approximate and indicate how much time you should spend on the problem.

• 10 points: linear and binary search for int, double, String, or Comparable
• 10 points: selection or insertion sort for int, double, String, or Comparable
                      in forward or reverse order.
• 5 points: questions about order of operations (how long does it take ...)
                      You must show how you got your answer.
                      (like the ones we have been doing at the beginning of class)
• 5 points: two-dimensional array problems
                      (like the ones from the recitation and Tic Tac Toe case study)
• 5 points: String methods problem: length, indexOf, substring, charAt
                      (like the one from Exam 2)
• 5 points: String manipulation problem
                      (like the ones from the recitation 4 and 9)
• 5 points: A problem involving ArrayLists.
                      (Know how to declare and create them.
                       Be able to use: get, add, set, remove, clear, and size)
• 5 points: Array of objects problem
                      (like the one from the Exam 3)
• 6 points: trace both selection and insertion sorts
                      (like handout from class)
• 10 points: diagram trace problems
                      (like on Exam 3, including Strings and arrays of objects)
  
• 15 points: design a class problem
                      (see the example problem below)
  

Practice writing the sort methods and time yourself to make sure you can do them fast enough.

Example Problem:
Design a class to represent a rectangle that can be drawn on the screen.
A rectangle has a position (x and y coordinates), a width, and a height.
A client should be able to get any of these four values, but not change them directly.
A client should be able to get the area of the rectangle and change the position of the rectangle by moving it horizontally by a given amount.
The class should implement Comparable based on the area.
What you produce should be able to be typed into eclipse and compile without errors.