Here’s the first homework.
The first problem is an implementation of k-nearest neighbors, applied to digit and spam classification. The second explores the curse of dimensionality via two simple simulations. The third is a number of exercises focusing on command line utilities (grep, wc, sort, uniq, tr) for which you’ll need the words.txt dictionary file.
