Time and Space Complexity: quiz

Questions 1 to 5 of 25

1. 1. What is the Big-O of 7n^2 + 50n + 300?

   O(n^2)O(n)O(7n^2)O(n^3)
2. 2. Which notation describes a tight bound, growing exactly like f?

   O(f)Omega(f)o(f)Theta(f)
3. 3. A loop for (i = 0; i < n; i++) runs how many times when n = 0?

   01n+1Forever
4. 4. What is the complexity of reading a[500] from an array?

   O(1)O(n)O(log n)O(500)
5. 5. Two separate loops, each running n times, one after the other. Complexity?

   O(n^2)O(n)O(2^n)O(n log n)