Java Illuminated, 5th Edition

15.7 Exercises, Problems, and Projects

15.7.1 Multiple Choice Exercises

1.   1. What is the Big-Oh of this function:

   T(n) = n² - 2 n + 99

   • ❑ O(n²)

   • ❑ O(99)

   • ❑ O(n)

   • ❑ O(1)

2.   2. What is the Big-Oh of this function:

   T(n) = n³ + 10 n² + 20 n + 30

   • ❑ O(n³)

   • ❑ O(n²)

   • ❑ O(n)

   • ❑ O(1)

3.   3. What is the Big-Oh of this function:

   T(n) = n² + n * log n + 12 n + 5

   • ❑ O(n * log n)

   • ❑ O(n²)

   • ❑ OO(n)

   • ❑ O(1)

4.   4. We have the following recurrence relation representing the running time of a function; what is the running time of that function?

   T(n) = T(n - 1) + 1

   • ❑ O(2ⁿ)

   • ❑ O(n * log n)

   • ❑ O(n²)

   • ❑ O(n)

5.   5. Which of these running times is the worst?

   • ❑ O(n⁵)

   • ❑ O(2n)

   • ❑ O(n * log n)

   • ❑ O(n)

6.   6. Look at the following method:

   public static int foo1