Computer Science 261

First Exam Review

Disclaimer: I have attempted to be comprehensive in the following, but important items may have been omitted by mistake. If you see such an omission, please let me know, but you are responsible for all of the lecture material to date.

The first hour exam in CSci 261 will be given on Friday, Sept. 24, and will cover through the first few sections of chapter 3 of the textbook together with the review of C++. Some details:

1. Basics: be comfortable with

• Sets and set operations
• Definitions (including ones discussed below)
• Summation notation
• Mathematical induction (there will be one or two induction proofs on the exam)
• The idea of an abstract data type
• The definition of an algorithm

1. Review of C++

• Review sorting and searching in arrays
• Review structs and be able to specify a structure and use a structure.
• Be comfortable with recursion (be able to write simple recursive functions or procedures)
• Be able to specify a class (object) to the extent of the part01.cpp exercise. Students who have not seen this before can find some more review material in the textbook currently used (and used last year) for CSci 161. Although some classes introduced objects in CSci 161, prior work with objects is not a prerequisite for this class. Additional tutorials on objects cheerfully given.

1. Basic analysis of algorithms

• We have not done much with this yet. Be able to discuss what should be counted in estimating run time, list the typical functions involved (linear, quadratic, exponential, logarithmic), and perhaps do some counting in a simple piece of code.