*

Problem Set 3

Complete the following problems.

  1. Give an analysis of the algorithm that you used to solve the hamming code problem in problem set 2. Since your algorithm was recursive, you should use a recurrence equation in your analysis.

  2. Do problem 30d and o on page 105 of Sahni. You must turn in the two programs complete with drivers and the variable count in the appropriate places. Problem 30 asks you to repeat problem 29, parts a through d. You must write down your answers to parts c and d (when you repate the questions 29a through d for problem 30d and 30o) and, in particular, your answers to part 29d should resemble figure 2.6 on page 95.

  3. Problem 36b and d onpage 106 of Sahni.

  4. Any program solution must be appropriately commented (see the guidelines posted here). You must test your solutions. Submit a folder that contains all of your code and the file(s) containing your test data to the folder /home/cs311/ps1 on the class server (ftp to 147.129.18.208 with the account name "yourLastName".)

  5. You may use any environment that you like to develop your code. I will test your code using the tools from the JDK (eg, javac and java). I will use the Java 2 implementation of the JDK (which is also used in the book). You can obtain the Java 2 JDK free at http://java.sun.com/j2se/

    Return to John Barr's Home Page

    Last Modified: 4 September 2001

    THIS PAGE MAINTAINED BY: John Barr, Ithaca College