Homework 0 (in postscript,
in pdf) --- Optional.
Homework 1 (in postscript,
in pdf) --- Due on Thursday September 19.
Homework 2 (in postscript,
in pdf) --- Due on Thursday Oct 3.The following is some text I created based on inspiration by a document on the web I found titled "Macho Driving in Massachusetts". (http://www.textfiles.com/humor/drive.txt). Having spent some time driving there while at MIT, I thought this would serve as some entertaining test data for problem 1 of HW 2. Here is the text which contains 148 words. You may use any mechanism you want to enter this into your program and to compute the lengths of each word (including just hand building a file with the word lengths).
You are to run the dynamic programming algorithm on this text where the maximum number of charactes per line is each of 70, 50, and 30. Remember to both show the layout that you obtained for each of these three line widths and also give the cost of your layout.
Homework 3 (in postscript,
in pdf) --- Due on Thursday October 24.
Homework 4 (in postscript,
in pdf) --- Due on Thursday November 7.Here's the sample data for alternate problem 5.
Homework 5 (in postscript,
in pdf) --- Due on Thursday December 5.