Com S 100J Introduction to Computer Programming Grade: letter or S/U Fall 2006
344-366 TR 09:05 Kimball B11 Instructor: David Gries 4 credits
344-422 TR 11:15 Kimball B11 Newsgroup: cornell.class.cs100j

Quizzes
Home
About email
Academic Excellence Workshop
Academic integrity
Announcements
DrJava
Exams
Grades
FAQs
Handouts, Lectures
    Assignments
    Labs
    Quizzes
Links
Staff info
Syllabus
Texts
Times & places
Newsgroup
Email Gries

 

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. 05 September (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. 12 September (Tuesday). You need to be able to (1) Draw a folder (instance, object) for a subclass, (2) write down the steps involved in evaluating a new expression, and (3) state the purpose of a constructor. Besides the text, look at the slides for the lecture of 7 September.
  • Quiz 03. 05 October (Thursday). Explain the steps in executing a method call, including drawing a frame for the call properly. Be able to perform the steps yourself on simple examples.
  • Quiz 04. 31 October (Tuesday). You should know the four loopy questions and how to use them to develop a loop, given the precondition and postcondition and an invariant.