ECS 110 - Fall 1995 - Prof. Phil Rogaway

Course information:

• Course information sheet (handout 1)
• Course syllabus (handout S)
• Office hours
• Grading criteria
• Regrade policy

Programming Assignments

Program 1 - DMV Simulation

• Program 1 problem statement (handout 2)
  
• rnd.C: Random number generator

Program 2 - Tautology Testing

• Program 2 problem statement (handout 3)
  
• Test cases

Program 3 - Forward Radix Sort

• Program 3 problem statement (without the [Anderson, Nilsson] paper) (handout 6)
  
• Timer and I/O routines you can use in Assignment 3
• [Anderson, Nilsson] paper: specifies the algorithm for Assignment 3
• Ted's (11.2 second) solution to Assignment 3

Program 4 - Traveling Salesman Problem

• Program 4 problem statement (without the [Horowitz, Sahni] supplement) (handout 8)
  
• tsp: Locations of 15 U.S. cities
• dist-earth.C: Code to compute distances on the earth
• Graph.C: I/O code (requires dist-earth.C)

Student scribe notes:

• Click here for on-line scribe notes (JT)

Discussion section lecture notes:

• Discussion section 1 (TK)
• Discussion section 2 (TK)
• Discussion section 3 (TK)
• Discussion section 4 (TK)
• Discussion section 5 (TK)
• Discussion section 6 (TK)
• Discussion section 7 (JT)
• Discussion section 8 (TK)
• Discussion section 9 (TK)

Exams (past and present):

• 4 - Practice Midterm 1
  
• Your Midterm 1 (handout 5)
  
• 7 - Practice Midterm 2
  
• Your Midterm 2 (handout 7)
  

Sample Code:

• bhutan.C: Making change in Bhutan
• memoization.C: above with memoization
• assoc.C: an associative array class
• And some C++ code implementing skip lists (TK)

Miscellaneous:

• Amortized analysis and Binomial Heaps (handout A)
• A readable paper on skip lists