Willamette University Computer Science CS 241: Data Structures

Instructor: (Associate Professor) Fritz Ruehr

Sample midterm exam

I have a sample exam from last year up here in PDF format. Notice that the order and emphasis of topics changes somewhat from year to year, so some questions here would be less appropriate for our semester (specifially, there is more emphasis here on recursion than we would likely have).

Sorting animations!

Click on one of the items below for some animated sorting algorithms:

• By Harrison, at the University of British Columbia
• The self-proclamed "Complete Collection of Algorithm Animations"

Some useful references (textbook resources, Sun's Java documentation)

• Sun's collections trail

• Object ordering (and name example)

Labs

Lab 1: click here

Lab 2: click here

Lab 3: click here

Lab 4: click here

Lab 5: click here

Lab 6: click here

Lab 7: click here

Lab 8: click here

There is some information on receiving window clicks (and responding to them) in this old CS 231 file.

Unfortunately, that material pertains mostly to the Applet style of programming, common in the Visual Cafe environment we used at the time. From NetBeans, if you want to read from a file, you'll want to start with a Frame instead, then right-click on the Frame in the form designer view to select an event response (then a mouse click).

Fun with powers of ten

Here's a nice little demonstration of the power of exponentiation (in base 10):

The Powers of Ten