Exam Review (A) Flashcards
1
Q
Computational Complexity
A
2
Q
Computational Complexity
A
3
Q
Computational Complexity
A
We don’t drop log m, because we don’t know the relationship between n & m
4
Q
A
5
Q
A
A, T(n) A = (n-1)^2
…T(n) B = (2n-1)^2
6
Q
Higher Growth Rate in terms of BigO?
A
A
7
Q
A
7
Q
What is the output?
A
6 (Addition of Digits)
8
Q
A
9
Q
A
10
Q
A
