Every once in a while, we will have a quiz in lecture. We will tell you what will be on the quiz. We expect everyone to get 100 on every quiz.

Reason for quizzes.

A course like CS100 uses a lot of terminology and introduces many new concepts. Typically, the terminology and concepts are used from the day they are introduced onward. If you don't learn them soon after they are introduced, you can't understand later lectures and material. So, each quiz alerts you to what is important for you to learn at that time (and forces you, hopefully, to learn it). We hope that you don't only superficially learn it but grok it. (If you don't know what grok means, bring up ProgramLive (the CD), open the glossary, and look at the entry for grok.

• Quiz 01. 30 January (Tuesday). You need to know (1) Definition of "type" (see p. 7 of text) , (2) how to execute the assignment statement (p. 28, box on top of page), (3) How to draw a manilla folder (instance, object) of a class. (See Fig. 1.3 on page 30 for an example).
• Quiz 02. 06 February (Tuesday). (1) How do you evaluate a new expression (see slide 6 of the lecture for 1 Feb). What is the purpose of a constructor (see slide 5 of the lecture for 1 Feb).
• Quiz 03. 5 April (Thursday). You will be asked to specify and then develop either (1) the binary search algorithm or (2) the partition algorithm, used in quicksort. You should specify it, using diagrams for the pre- and post-conditions. Then develop the loop invariant. Finally, write the algorithm using the four loopy questions. Do not attempt to memorize code. Instead, develop code from the spec and loop invariant. Practice this by writing, not be reading.