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 CS1110 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. In class, Tues, 27 Jan. 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).
• Quiz 02. In class, Tues, 3 Feb. How do you evaluate a new expression (see slide 6 of lecture notes for 29 Jan.)?What is the purpose of a constructor (see slide 7)?
• Quiz 03. In class, Thurs, 2 April. Be able to do the following, for the algorithms Dutch National Flag and Binary Search: (1) Write down its specification (pre- and post-conditions), (2) develop an invariant from the pre- and postconditions, and (3) write the loop with initialization, based on the invariant and pre- and post-conditions.

Dutch National Flag was done in class today; Binary Search will be developed on Tuesday. Dutch National Flag is on the PLive CD, and Binary Search in the text. Look in the announcement table on the home page for more information on them.