CSc 2510, Theoretical Foundations of Computer Science
Fall 2007
Homework 6 (Due: Wednesday, October 31th)

  1. Solve the following problems from Section 2.2: 45, 66, 71, 73
  2. Solve the following problems from Section 2.4: 10, 29, 39, 40, 43
  3. Solve the following problems from Section 2.5: 3, 5, 12
  4. Write a recurrence relation for the number of line segments (horizontal+vertical) in a Hilbert curve C(n). Solve the recurrence relation for a closed-form solution using the expand-guess-verify technique.
    Hilbert Curve Definition
pdf scan of problems (along with parts of my shirt sleeve!)

Page Maintained by raj@cs.gsu.edu