For this part you're going to compare a number of different approximate solutions to the traveling salesman problem. You should code the brute force solution (where you try every possible combination), and two other approximate search methods. In your report, you should compare how long each one took, and how close to the optimal solution it got for several different sized datasets.
For this section, you will be coding and comparing two exact solutions to the three color problem. Compare each of these to each other, and to the brute force method.
For this, you will be either coding a backpropgation neural network or a decision tree, and comparing it's effectiveness at classification to k-nearest neighbors for a synthetic dataset (there are a number of classifcation datasets that can be found online, I'll link those soon).