CPSCI 330: Algorithms

Homework 1.5

due: February 6, 2007

This assignment may be hand written on lined paper (but please be neat). You may use pen or pencil as long as the markings you make are legible.

Homework Problems

1. Explain how showing that

   For b > a > 0: bⁿ ∉ O(aⁿ)

   suffices to prove

   For a, b > 0, a ≠ b: Θ(aⁿ) ≠ Θ(bⁿ)

2. Exercises 2.3: problem 4 or 6 (your choice)

[ Return to the CPSCI 330 homepage ]