http:^^pine.cs.yale.edu:4201^cs112^schedule.html

来自「This data set contains WWW-pages collect」· HTML 代码 · 共 534 行 · 第 1/2 页

      <dt><a name="midterm"></a>10/16/96</dt>
      <dd><strong>Midterm.</strong> The midterm will be give in class
        at the usual time and location.  It will be a closed-book
        test, covering everything discussed in class up to 10/11/96.
        You should be comfortable with the material in Chapters 1, 2, 3
        (Sections 3.1-3.4 only), 4, 5, 6, and Sections 11.1-11.4 and
        12.1 and 12.2 in the book.  A <!WA35><a href="http://pine.cs.yale.edu:4201/cs112/sample-midterm.html">sample
          midterm</a> is available showing roughly the length and types
        of questions you should expect; you may wish to try going through
      this before the review session to see if you have any
      questions.  Note that questions on the sample midterm are not
      exhaustive: the real midterm may touch on different subjects and
      use different types of questions.
        <dl>
          <dt>Handouts:</dt>
          <dd><!WA36><a href="http://pine.cs.yale.edu:4201/cs112/hw5.html">Assignment Five.</a></dd>
        </dl>
      </dd>


      <dt>10/14/96</dt>
      <dd>Review session.</dd>

      <dt>10/11/96</dt>
      <dd>More tricks with arrays.  Computing minima and maxima,
        searching, sorting.<dl>
          <dt>Readings:</dt>
          <dd>Sections 11.6, 11.7.</dd>
          <dt><!WA37><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.10.11/">Demos:</a></dt>
          <dd><ul>
              <li><!WA38><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.10.11/arrayMauler.p">arrayMauler.p</a></li>
            </ul>
          </dd>
        </dl>
      </dd>

      <dt>10/9/96</dt>
      <dd>Arrays.<dl>
          <dt>Readings:</dt>
          <dd>Sections 11.1-11.4, 12.2.</dd>
          <dt><!WA39><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.10.09/">Demos:</a></dt>
          <dd><ul>
              <li><!WA40><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.10.09/arrayExample.p">arrayExample.p</a></li>
            </ul>
          </dd>

        </dl>
      </dd>

      <dt>10/7/96</dt>
      <dd>Records and abstract data types.<dl>
          <dt>Readings:</dt>
          <dd>Section 12.1.  (Yes, this is skipping ahead a lot.
            We'll come back.)</dd>
          <dt><!WA41><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.10.07/">Demos:</a></dt>
          <dd><ul>
              <li><!WA42><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.10.07/abstractBall.p">abstractBall.p</a></li>
            </ul>
          </dd>
        </dl>
      </dd>

      <dt>10/4/96</dt>
      <dd>Procedures with state.  Most procedures maintain no
      information from one call to the next, so they always act
      exactly the same way.  Sometimes this isn't what we want, so by
      used of a global variable or a call-by-reference parameter we
        can produce procedures like <em>iterators</em> (returning
        e.g. 1,2,3,4,5, etc.) or <em>pseudorandom number
      generators</em> (which return random-looking numbers; see also
        the <!WA43><a href="http://pine.cs.yale.edu:4201/cs112/library.html#random">library of useful
      procedures</a>).</dd>

      <dt>10/2/96</dt>
      <dd>Examples of using call-by-reference parameters and
        functions.  Getting input from the mouse.
        <dl>
          <dt><!WA44><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.10.02/">Demos:</a></dt>
          <dd><ul>
              <li><!WA45><a
                  href="http://pine.cs.yale.edu:4201/cs112/programs/1996.10.02/average.p">average.p</a>
                illustrates use of various techniques to return information
                from procedures.</li>
              <li><!WA46><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.10.02/mouse.p">mouse.p</a> A
                simple drawing program.</li>
              <li><!WA47><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.10.02/button.p">button.p</a>
                Detecting button clicks.</li>
            </ul>
          </dd>
          <dt>Handouts:</dt>
          <dd><!WA48><a href="http://pine.cs.yale.edu:4201/cs112/hw4.html">Assignment Four.</a></dd>
        </dl>
      </dd>

      <dt>9/30/96</dt>
      <dd>How Pascal uses memory.  Global variables vs local
        variables.  Call-by-reference (var) parameters.  Functions.
        <dl>
          <dt>Readings:</dt>
          <dd>Sections 6.2-6.4.</dd>
        </dl>
</dd>

      <dt>9/27/96</dt>
      <dd>Examples of using while and repeat..until loops.
        <dl>
          <dt><!WA49><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.27/">Demos:</a></dt>
          <dd><ul>
              <li><!WA50><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.27/loopdemo.p">loopdemo.p</a></li>
            </ul>
          </dd></dl>
      </dd>

      <dt>9/25/96</dt>
      <dd>More applications of loops: animation.  Unbounded loops.<dl>
          <dt>Handouts:</dt>
          <dd><!WA51><a href="http://pine.cs.yale.edu:4201/cs112/hw3.html">Assignment Three.</a></dd>
          <dt><!WA52><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.25/">Demos:</a></dt>
          <dd><ul>
              <li><!WA53><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.25/animation.p">animation.p</a></li>
            </ul>
          </dd>
          <dt>Readings:</dt>
          <dd>Sections 5.3, 5.5.</dd>
        </dl>
      </dd>

      <dt>9/23/96</dt>
      <dd>More about for loops.  Debugging.  Fencepost errors.
        <dl>
          <dt><!WA54><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.23/">Demos:</a></dt>
          <dd><ul>
              <li><!WA55><a
      href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.23/dashes.p">dashes.p</a></li>
              <li><!WA56><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.23/timestables.p">timestables.p</a></li>
            </ul>
          </dd>
        </dl>
      </dd>

      <dt>9/20/96</dt>
      <dd>Introduction to loops.  Bounded loops: for/to and
      for/downto.
        <dl>
          <dt><!WA57><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.20">Demos:</a></dt>
          <dd><ul>
              <li><!WA58><a
          href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.20/bottles.p">bottles.p</a> "99
          Bottles of Beer on the Wall" --- a simple program using a for
          loop.</li>
              <li><!WA59><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.20/circles.p">circles.p</a>.  Draws
          a bunch of circles; example of nested for loops.</li>
            </ul>
          </dd>
          <dt>Readings:</dt>
          <dd>Sections 5.1, 5.2, 5.8 (first part).</dd>
        </dl>
      </dd>

      <dt>9/18/96</dt>
      <dd>The case statement.  Local variables.
        <dl>
          <dt>Demos:</dt>
          <dd><!WA60><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.18/">personality.p</a> (Case
            statement demo).</dd>
          <dt>Handouts:</dt>
          <dd><!WA61><a href="http://pine.cs.yale.edu:4201/cs112/hw2.html">Assignment Two.</a></dd>
          <dt>Readings:</dt>
          <dd>Section 4.7 (case statement), Sections 2.3, 2.4, 6.1.</dd>
        </dl>
      </dd>

      <dt>9/16/96</dt>
      <dd>More tricks with if/then statements.  Boolean expressions
        and variables.  Preview of recursion.
        <dl>
          <dt><!WA62><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.16/">Demos:</a></dt>
          <dd>
            <ul>
              <li><!WA63><a
                  href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.16/admission.p">admission.p</a> (Yale College admissions program)</li>
              <li><!WA64><a
                  href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.16/fancyFaces.p">fancyFaces.p</a> (blinking faces)</li>
              <li><!WA65><a
                  href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.16/recursive.p">recursive.p</a> (bomb timer program using recursive procedures)</li>
            </ul>
          </dd>
          <dt>Readings:</dt>
          <dd>Sections 4.4, 4.6, 4.8.  Resist the temptation to read
            Section 4.5: the description of how to get the mouse
            position will not work in Think Pascal.</dd>
        </dl>
      </dd>

      <dt>9/13/96</dt>
      <dd>Pascal syntax and the mysteries of semicolon placement.
        Begin..end blocks.  If/then statements.
        <dl>
          <dt>Readings:</dt>
          <dd>Sections 4.1-4.3 (various forms of if/then statements).</dd>
        </dl>
      </dd> 

      <dt>9/11/96</dt> 
      <dd>More graphics.  Decomposing tasks into subtasks, and then
      building procedures to do all the subtasks.
        <dl>
          <dt>Demos:</dt>
          <dd><!WA66><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.11/">face.p</a> Draws a bunch
            of cartoon faces.</dd>
          <dt>Handouts:</dt>
          <dd><!WA67><a href="http://pine.cs.yale.edu:4201/cs112/hw1.html">Homework One</a></dd>
          <dt>Readings:</dt>
          <dd>Sections 3.1-3.4, 3.10 (basic graphics commands).</dd>
        </dl></dd>

      <dt>9/9/96</dt>
      <dd>Arithmetic.  Integers vs reals.  Graphics commands.<dl>
          <dt>Demos:</dt>
          <dd><!WA68><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.09/">drawing.p</a> (Basic
            drawing commands).</dd>
          <dt>Readings:</dt>
          <dd>Sections 2.1-2.3, 2.5 (arithmetic); 2.7-2.8 (drawing
            lines).</dd>
        </dl>
      </dd>

      <dt>9/6/96</dt>
      <dd>Declaring and using constants and procedures.  How avoiding
        redundancy increases clarity and power of programs.
        <dl>
          <dt>Demos:</dt>
          <dd><!WA69><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.06/">Old MacDonald program.</a></dd>
          <dt>Handouts:</dt>
          <dd><!WA70><a href="http://pine.cs.yale.edu:4201/cs112/howto.html">HOW TO sheet.</a></dd>
          <dt>Readings:</dt>
          <dd>Sections 1.8 (simple procedures), 2.12 (constants), 6.1
            (procedures with parameters). You should probably also
            read Sections 2.10 and 2.11 (input and output).</dd>
        </dl>
      </dd>

      <dt>9/4/96</dt> 
      <dd>Introduction.  How the course is set up.
        What programming is all about.  Running Think Pascal.
        <dl>
          <dt>Demos:</dt>
          <dd><!WA71><a href="http://pine.cs.yale.edu:4201/cs112/programs/1996.09.04/">boring.p</a></dd>
          <dt>Handouts:</dt>
          <dd><ul>
              <li><!WA72><a href="http://pine.cs.yale.edu:4201/cs112/syllabus.html">Course Information</a></li> 
              <li><!WA73><a href="http://pine.cs.yale.edu:4201/cs112/hw0.html">Homework Zero</a></li>
              <li>Introductory computer science courses.</li>
            </ul>
          </dd>
          <dt>Readings:</dt>
          <dd>Chapter 1.</dd>
        </dl>
      </dd>
    </dl>

<hr>
<p><!WA74><a href="http://pine.cs.yale.edu:4201/cs112/index.html">Return to the CptSci 112a home page.</a></p>
  </body>
</html>