CS 210 – Fundamentals of Programming I
Spring 2007 – Final Exam Review Sheet

Reminders and announcements:

• The last day of class has been set aside as a review day for the Final Exam. We will go over Homework 6, so it is due at the beginning of class that day. It will not be accepted as late work. Come prepared to ask and answer questions about the course material.

• Programming Project 1, Part B is due on the last day of class at regular time, 4:30pm.

• The practical exam retake will be on Reading/Study Day, Wednesday, May 2, 4:00pm-6:00pm. All students who scored less than 60 on the practical exam are expected to retake it. Others may retake it if they wish. Reminder: the highest score possible on the retake is 90/100. In addition to the topics covered by the first practical exam, use of arrays, strings, and/or vectors may be included. Classes, recursion, and pointers will not be included. You must inform your instructor no later than the end of the last day of class, if you are retaking the practical exam.

The Final Exam will be held during the regularly scheduled time for each section. That is,

• Section 01 and 03H: Thursday, May 3, 12:30pm-2:30pm

• Section 02: Friday, May4, 2:45pm-4:45pm

You may bring one 8.5in x 11in sheet of paper with notes on (only) one side to the exam. You may print out the sheet, but it must be in a 9-point font or larger. E.g., please do not photoreduce or print 4 pages on 1 side. If you handwrite your notes, they can be as small as you like. You may handwrite notes in the margins of a printout.

The exam will be cumulative and comprehensive. You will be expected to be able to read and write code or analyses and designs using concepts from the entire course. Emphasis will be on the material since Exam 2 in Chapters 8, 9, 11, and 14 and the material covered in lectures, exercises, and assignments through Tuesday, November 28. This material will comprise about one-half of the exam. You are not responsible for the material on files or formatting (Chapter 6), C-style strings (Chapter 8.1) and issues regarding copying, assigning, and deallocating objects containing pointer attributes (Chapter 11.4).

The format of the exam will be similar to that of previous exams, homework, and exercise questions. That is, you will be asked to write code examples, you will be asked to read and explain code examples, and you will be asked to analyze and design functions and programs to solve particular (sub)problems.

The following is a list of topics that will be emphasized, but it is in no way to be construed as an exclusive list. In addition, previous review sheets should be consulted for earlier topics.

1. Analysis, design, and implementation of main programs and functions using the following constructs.

2. Strings and vectors - declaration and use

3. Classes - design, implementation, and use. Including class objects as parameters, overloaded operator and friend functions, and vectors of class objects.

4. Recursion - what it is and how to use it; drawing execution traces.

5. Pointers - allocation and deallocation of dynamic data (both single variable and arrays); distinguishing between pointer variables, pointer values, and the "pointee"; accessing and manipulating pointer variables and pointees; drawing memory pictures.

When you are asked to write code, you will not need to write comments, function prototypes, include directives, or output formatting beyond producing newlines in appropriate places.