Reading Assignment and Discussion Topics
Computer Science 111

for class on Thursday Feb. 10, 2000

Please read Sections 2.3.3 through 2.4 of the Schneider and Gersting text, and be prepared to discuss the following:

The pattern-matching algorithm on page 60 has a nested loop: one Repeat loop appears inside another. This is an extremely useful structure that we will see again and again. Here's another application: find the location of the black king on a chessboard, assuming you can examine just one square at a time. Here's another: count the number of white pawns on the chessboard. How would you approach these problems?