Assignment 2

Assignment 2
CS 256
due October 20, 1998
100 points

Implement a version of Quinlan's ID3 algorithm using at least the data types for tree nodes and datapoints whose selectors and constructors are given in the file a1.drs available at the course web site. Test with the test data data1-data5 available there.

You may test simply by calling (pretty-print (id3 data)), where data is one of the data sets to be tested. The function pretty-print may be spelled differently in your implementation. You may also define your own pretty-printing function.

Your top-level id3 function should return a tree node (that is, an instance of the data type mentioned above). You needn't worry about contradictory classifications of identical tuples, or noisy input in general.