CS 210 ­ Fundamentals of Programming I  Spring 2013 ­ Written Exam 1 Review Sheet

CS 210 ­ Fundamentals of Programming I Spring 2013 ­ Written Exam 1 Review Sheet
Reminders and announcements: ●
Monday/Tuesday, February 25/26, has been set aside as a review for Written Exam 1. We will go over Homeworks 3 & 4 as part of the review. In addition, come prepared to ask and answer questions about the exam material. ●
The SI session on Thursday, February 28, will be held, but will be delayed by 30 minutes to 8:00­9:00pm due a conflict that Allie has that evening.
Note that Homework 5 and Programming Assignment 5 are due after spring break. However, please do not wait until after spring break to start them. It would be to your benefit to complete both assignments substantially before leaving for spring break.
The reading assignment for the week after spring break is as posted, Chapter 8 on strings. The section of Chapter 7 on multi­dimensional arrays will be covered the following week before the material on structs (Chapter 10).
Written Exam 1 will be on Wednesday/Thursday, February 27/28. 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 10­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 consist of questions on the material in Chapters 1­6; material covered in lectures and in­class exercises through February 11/12; material in homeworks 1­4; and programming assignments 1­4. Material on file streams (Chapter 11; Chapter 12 in 6/e) and arrays (Chapter 7; Chapter 8 in 6/e) will not be on the exam. The format of the exam will be similar to that of in­class exercise questions, homework questions, and programming assignments. There will be questions asking you to explain and/or write C code examples, and short answer questions regarding concepts.
The following is a list of topics that will be emphasized, but it is in no way to be construed as an exclusive list. 1. Analysis and design of main programs and functions. Differences between received, returned, passed back, and local objects, as well as input and output objects. 2. Declaration and use of constants and variables, use of arithmetic, relational, and logical operators, assignment statements. 3. Use of input and output statements. 4. Use of selection constructs: single and multi­branch if constructs 5. Use of repetition constructs: pre­test (while) loops, post­test (do­while) loops, counter­controlled (for) loops, sentinel­controlled loops, flag­controlled loops, and their implementations. 6. Implementation of functions, including how to define and use them, (actual) arguments vs. (formal) parameters, value vs. reference parameters, and the use of the void return type.
When you are asked to write code, you will not need to write comments, function prototypes, or include directives.
Page 1 of 1
D. Hwang