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, Tuesday, 9 September. 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). GRADES NOT RECORDED.
• Quiz 02. In class, Tues or Thurs, 11 or 13 November. Be able to develop algorithms "Partition", "Dutch National Flag", and "Binary search" from their specifications. Here is a list of algrithms specs and invariants. pdf ppt