16

Reading Assignment and Discussion Topics
Computer Science 111

for class on Thursday April 2, 1998

Please read Section 7.4 (pp. 273-291) of the Schneider and Gersting text, and be prepared to discuss the following:

The text uses the Pascal programming language, but in your programming labs you will be using Java, and in particular the parts of Java that are the same as C. There are a few differences between Pascal and C/Java, summarized in a handy table which may be on the back if this is a hardcopy.

Please prepare for this class by doing some programming in Pascal or C. Pick any two examples from the following list. The algorithms get harder as you go down the list, so if you find this pretty easy try the ones at the end of the list. Use at least one for loop, and do at least one of the two programs in C.

• Find the smallest element of an array (class 1)
• Find the second-biggest element of an array (midterm exam)
• Euclid's algorithm (problem set 1--C has a lovely operator you should use: m % n is the remainder of m divided by n)
• Count the number of white pawns on a chessboard (class 4)
• Binary search (class 7)
• Bubble sort (problem set 3)