Summary:  1
CS 2420
Public Exam 1
100 Points

Multiple Choice (3 points each) Pick the single best answer

1. For the timing information below, what is the complexity?
n T(n)
2 9
4 38
8 153
16 614
32 2457
(a) O(1) (b) O(log n) (c) O(n) (d) O(n log n) (e) O(n^2) (f) can't determine
2. From our theorem we know:
T(n)= a T(n/b) + O(n^k)
if a > b^k T(n) is O(n^{log_b a})
if a = b^k T(n) is O(n^k{log n})
if a < b^k T(n) is O(n^k)

Source: Allan, Vicki H. - Department of Computer Science, Utah State University

Collections: Computer Technologies and Information Sciences