CS 117 Programming Examples

  1. From class on 1/13/97. Two menu-driven programs: one using if-then-else-if-then-else... ( menu.p) and one using a case statement (menu2.p).
  2. From class on 1/29/97. Using files for input (inputFiles.p) and output (outputFiles.p).
  3. From class on 1/31/97. Using a new version of ReadWord with files (readingWords.p).
  4. From class on 2/17/97. The program sort.p has two sorting procedures (implementations of Insertion Sort and Selection Sort) and a couple of utility procedures that help test sorting routines.
  5. From class on 2/19/97. The program sortrandom.p generates random permutations of integers and sorts them. You can use this program to study how long various sorting algorithms take to run.
  6. From class on 2/26/97. Linked lists used to implement a strings data type ( liststrings.p).




Jeff Ondich, Department of Mathematics and Computer Science, Carleton College, Northfield, MN 55057, (507) 646-4364, jondich@carleton.edu