CS 1320 (Principles of Algorithm Design I):
Review for Exam #3

Format of the exam

The exam will be at the time scheduled for the course's final (see the course schedule or the syllabus), and the format will be very similar to the previous two exams, except that the exam will be longer and you will have more time (up to the full three hours). You may use your textbook and any notes or papers you want to bring, but you may not use other books, a calculator, a computer, or each other's papers.

If you have kept up with the reading, the homeworks, the lectures, and the material covered in the quizzes, you should be fairly well prepared already.

The following are some kinds of questions that might be on the exam. It is not necessarily an exhaustive list of all types of questions on the exam, but should give you an idea of what to expect. In general the questions will likely be much like the ones on previous exams.

Given a short C++ program, or partial program, say what it prints out when executed.
Given a C++ function definition, say what it returns, or how it modifies any pass-by-reference parameters.
Given a C++ program that is known to be incorrect (does not compile, or does not produce the expected results), explain what is wrong and/or how to fix it. If the program does not compile, you will be told what error messages the compiler produces; if it produces wrong results, you will be told what these wrong results are.
Write a C++ program to solve a given problem.
Write a C++ function to perform a given task. For example, if you were asked to write function to add two integers and return the (integer) result, you might write the following function.
```
	int sum(const int a, const int b) 
	{    return a + b;    }
	
```
You may be told to make the function recursive.
"Fill in the holes" in a given C++ program. You may be given the main program and asked to fill in some functions, or you may be given some functions (possibly just their prototypes and comments indicating what they do) and asked to write the main program. You may also be given a class or classes to use.
Write a C++ class to represent a given type of variable (as in the first problem in Homework #9). You might be given part of the class and asked to fill in the rest.

Topics to review

You are responsible for all material covered in class or in the assigned reading. This exam will focus on material covered since the previous exam, but it will inevitably also include material covered earlier in the course. See Homeworks and other Assignments for a list of assigned reading. You should review in particular the following topics. Again, this list is not necessarily exhaustive, but should give you an idea of what topics I consider most significant in this part of the course.

C++ classes:
- The ifstream, ofstream, and string classes.
- Using classes defined by someone else (e.g., the ones above).
- Defining your own classes.
Recursive functions.
Command-line arguments.
Sorting, searching.

The exam will likely focus more on the first two topics than the last two.

CS 1320 (Principles of Algorithm Design I): Review for Exam #3

Format of the exam

Topics to review

CS 1320 (Principles of Algorithm Design I):
Review for Exam #3