- Program Correctness (75%): The programs do everything that the
lab requires. If you have a question about how a program handles
a certain input, check the executables that have been provided.
Subtract 35 points from the lab's final grade if the broker program does
not use Dr. Plank's red-black tree library.
- btree_experiment (40 points)
- Number of words correctly computed (3 points)
- log n correctly computed (3 points)
- Binary tree stats correctly computed (10 points)
- AVL tree stats correctly computed (10 points)
- Splay tree stats correctly computed (10 points)
- Output correctly formatted (4 points)

- broker (35 points)
- customers are printed in descending order by total transaction
cost (5 points)
- total transaction costs are properly computed (5 points)
- the format of the report's output matches the format of the
executable's output (3 points)
- the program discards transactions with errors and continues
executing (3 points)
- the program properly uses a red-black tree to store customers
and then for each customer a transaction list (10 points)
- the program properly uses a red-black tree to sort customers
by total transaction cost once all transactions have been read
(5 points)
- the transaction struct is properly organized and includes a
union (4 points)

- Commenting (15%): See the commenting
information
on the course's web page for advice on how to comment your programs,

- Program Style (10%): Are the programs well-organized and do they
solve the problem in the most straightforward, efficient way possible.