CS 136 Tutorials - Spring 2007

Tutorials »

Tutorial 4: Poker Hands and Efficiency (May 25)

The first part of today's tutorial makes effective use of the ADT implementations from Tutorial 3 in order to compute some experimental probabilities involving poker hands. Next, we will look at a given implementation of a function, analyze the cost, then write an improved version and redo the analysis. The material here comes from lecture modules 4 and 5 (see Handouts).

  1. Using an ADT implementation
  2. For this part of the tutorial, we will be using the two classes DEQ% and card% that were developed in last week's tutorial. Code for these classes can be found here.

  3. Efficiency

Last modified on Friday, 19 August 2011, at 18:05 hours.