CS 321: Homework 4

Due date: Wednesday, November 5, 2008


Section 4.1: 6, 17, 25

Section 4.2: 14 (You do not need to write out detailed pseudo-code for an
                 algorithm. Just describe the main steps of your algorithm,
                 possibly refering to one or more of the algorithms 
                 introduced in the book section.)

Section 4.3: 4c, 4d, 5d (see hint below), 12, 16


Hint for 5d: It may be useful to use the fact that m < 2^m for m >= 0.
             In particular 2^m + m < 2^m + 2^m.