Computer Science 261

Exam 2 Review

The exam will consist of material covered in chapters 1 - 5 of the textbook, programming assignments, and material on mathematical preliminaries covered in lecture (and partially in the textbook). 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 give a definition of an abstract data type and of an algorithm, taking note that the lecture definitions may be slightly different from the textbook definitions (and you should know both). Exam questions will be with respect to the lecture definitions.
• Be able to say what assertions and loop invariants are, how they might be useful, and identify them.
• Be comfortable with the programming work in Java we have done since the last exam (particularly in the homework). Be able to write both sequential and binary searches in arrays of strings, and be able to sort an array of integers (and to identify the loop invariant involved).
• Be able to work with
  • logarithms
  • set theory
  • logic (truth tables)
  • mathematical induction (be able to state what it is and to do a simple problem of the variety found in the problem set (summation exercises)).