Reading Assignment and Discussion Topics
Computer Science 111

for class on Thursday Feb. 3, 2000

Please read Chapter 1 of the Schneider and Gersting text, and be prepared to discuss the following issues:

In the first class meeting you filled out a form indicating your preference for lab slots. Each of you ranked the 5 available lab periods in order of preference, and indicated which were utterly impossible for you due to conflicts with other classes and commitments.

How would you assign students to labs? Please come up with a method or algorithm for this problem, bearing in mind that the capacity of each lab is 15 students. Write down your algorithm, and consider how it conforms to the definition of algorithms given in the text.

During class we will discuss and compare several student algorithms--how would you compare different algorithms for the same problem?