CSc 120 (Fall 2017): Assignment 12

This assignment begins working with trees (long problem) and continues working with recursion (short problem).

General Requirements

1. Your code should follow the style guidelines for the class.
2. You should only use external libraries that have either been mentioned either in class or else in the assignment spec.

Short Problems (Due 7pm Sat Nov 18)

(20 points)

The process for turning in your solutions is as in previous assignments. There is one problem, described below, which is listed under the assignment name "Assg 12".

1. Binary Search Trees

Long Problem (Due 7pm Mon Nov 27)

(80 points)

1. Prefix Codes
   File: huffman.py

Hours and Observations (extra points!)

(2 points total)

We'd like to know more about how much time students are spending on the assignments and what students think about the assignments. If you'd care to give us some data and/or some feedback, here's one way to do that:

Submit a text file named observations.txt with...

• (1 point) Estimates of
  1. How long it took you to complete the short problem.
  2. How long it took you to do the long problem.

  We'll use a program to extract the data so please match the format of these examples:

  Short problem hours: 0.75
  huffman.py hours: 4
  

  Use your best guess for the hours. Integers or decimal fractions are fine.

  If you want to add some detail, like "Did huffman.py while in a turkey coma.", that's fine, but put it on a separate line.

  General comments about the assignment are welcome, too. Was it too long, too easy, too detailed? Speak up! We appreciate all feedback, favorable or not.

• (1 point) If you made any interesting course-related observations or discoveries while working on the assignment, we'd love to hear about those, too.

Submission information:

Submit the files specified above at http://gradeit.cs.arizona.edu/gradeit-v1/public/120/17au/homework/turnin/hw12.html