Computer Science 261

Exam 2 Review

In particular, you should be comfortable with the following (caveat: the following should be taken only as a guide. You are responsible for the material in readings, lectures, and homework. If, however, it appears that I've left something important out of the following, please do let me know - it's probably a mistake on my part and may still appear in the exam)

• Be able to implement a full class.
• Be able to specify and use iterators.
• Be able to throw and catch exceptions, including exceptions you define
• Be able to implement stacks and queues using arrays
• Be able to describe how a stack calculator calculates postfix expressions
• Be able to describe the infix -> postfix translation algorithm.
• Be able to use the following built-in data structures to the extent covered in class
  • Vector
  • Stack
    • Current homework turned in by 5:00 Wednesday will be returned in class Thursday.
  • ArrayList
  • LinkedList
  • BufferedReader
  • StringTokenizer
• Be able to write a binary search (there is a useful loop invariant which makes it work - we should review that Thursday, but that will not be on the exam)
• Be able to describe "Big - O" and why it is useful.