MAIN POINTS TO KNOW FROM THE HANDOUTS:

More Selection

-- Key terms: dangling else; drop-through behavior

-- 3 forms of the if statement

-- How the dangling else problem is resolved

-- The problem with using relational operators to compare objects (i.e., values whose type is a reference type) and what's the solution?

-- The form of a switch statement; when it can be used and when it can't; it's drop-through behavior and how it's avoided

-- The major difference between an if-else if implementation of a multi-alternative selection and a switch with regard to execution time

Note: We won't include conditional expressions (? :) nor the material about boolean circuits.

More Repetition

-- Key terms: pretest loop; posttest loop; zero-trip behavior; one-trip behavior

-- Be able to write while and do loops; also how to figure out what they do if we give you one and ask, for example, what output it produces

-- How to convert between while or do loops and the equivalent forever loop

-- Know what query-based input loops are

Arrays

-- Key terms: zero-based;

-- Know the three forms of array declarations

-- Know that an array is accessed via a handle

-- Differences in what's stored between an array of primitive-type values and an array of reference-type values

-- Be able to describe what a piece of code containing a for loop does with array elements (like the ones on Slide #9 in average() and in printStats().

SOME COMMENTS ABOUT THE TEXT READINGS:

Sections listed are the only ones for which you're responsible on this quiz.
Also, I have posted solutions to the exercise sets listed here.

Chap. 7

Sections 7.1-7.3

Quick Quiz 7.3 is good; so are Exercises 7.2 and 7.3

Chap. 8

Sections 8.1-8.5

Quick Quiz 8.5 and Exercises 8.5 are good.

Chap. 9

Sections 9.1-9.2

Quick Quiz 9.2 (#1-5, 9-14) and Exercises 8.5 (#1-16) are good.

SOME COMMENTS ABOUT THE VIDEO Inventing the Future:

Questions will be taken from list on the handout starting at "IBM."