CS 1713 Introduction to Computer Science
Spring 2009 Exam 3 Information

Exam 3 will last 50 minutes and consist of questions worth a total of 100 points.
Among the questions on the exam will be:

• 20 points: linear and binary search for int, double, String, or Comparable
• 20 points: selection or insertion sort for int, double, String, or Comparable
                      in forward or reverse order.
• 10 points: question about order of operations
                      (like Rec 9, problem 3, but not necessarily for twice as large)
• 10-12 points: trace both selection and insertion sorts
                      (like handout from class)
• 8-12 points diagram trace
                      (like on Exam 2, but including an array of objects)

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