CS 241, Spring 99, Homework 2 Practice Exercises
In past semesters, students have requested some practice exercises that are like those in the homework. These are optional and are not submitted.

Homework 2 follows up on a lot of problems done in Homework 1. Thus you should also use Homework 1 and the HW 1 practice problems for this purpose. Together, we can solve any of these (as requested) at the help session or at our office hours. Also, I will upon request post brief solutions so that you can check your answers and get some guidance on how to solve these problems.

If you would like additional practice problems, please let me know which type of problems you want more practice with.

  1. Clearly when I created problem 1 with some "random" T/F questions on asymptotic notation I have a personal bias towards true statements. Here's some more examples.

    1. 3 n^2 + 10 n log n = O(n log n
    2. 3 n^2 + 10 n log n = Omega(n^2)
    3. 3 n^2 + 10 n log n = Theta(n^2)
    4. n log n + n/2 = O(n)
    5. SQRT(n) + log n = O(n)
    6. SQRT(n) + log n = O(log n)
    7. SQRT(n) + log n = Theta(log n)
    8. SQRT(n) + log n = Theta(n)
    9. SQRT(n) + log n = Theta(SQRT(n))
    10. SQRT(n) + log n = Omega(1)
    11. SQRT(n) + log n = Omega(log n)
    12. SQRT(n) + log n = Omega(n)