Quiz
Other Algorithms
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (24)
1What is the space complexity of the iterative Bigsum algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
2What is the time complexity of the iterative Bigsum algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
3What is the space complexity of the recursive Bigsum algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
4What is the time complexity of the recursive Bigsum algorithm?
- AO(1)
- BO(n)
- CO(logn)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
5What is the space complexity of the iterative Euclidean algorithm?
- AO(1)
- BO(n)
- CO(logn)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(n!)
- HO(2^n)
6What is the time complexity of the iterative Euclidean algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
7What is the space complexity of the recursive Euclidean algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
8What is the time complexity of the recursive Euclidean algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(n!)
- HO(2^n)
9What is the space complexity of the iterative Factorial algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(n!)
- HO(2^n)
10What is the time complexity of the iterative Factorial algorithm?
- AO(1)
- BO(n)
- CO(logn)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
11What is the space complexity of the recursive Factorial algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
12What is the time complexity of the recursive Factorial algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
13What is the space complexity of the iterative Fibonacci algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
14What is the time complexity of the iterative Fibonacci algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
15What is the space complexity of the recursive Fibonacci algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
16What is the time complexity of the recursive Fibonacci algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
17What is the space complexity of the tail-recursive Fibonacci algorithm?
- AO(1)
- BO(n)
- CO(logn)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
18What is the time complexity of the tail-recursive Fibonacci algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
19What is the space complexity of the iterative Tribonacci algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
20What is the time complexity of the iterative Tribonacci algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
21What is the space complexity of the recursive Tribonacci algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
22What is the time complexity of the recursive Tribonacci algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
23What is the space complexity of the tail-recursive Tribonacci algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
24What is the time complexity of the tail-recursive Tribonacci algorithm?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
Information
- Description
- Quiz on Other Algorithms, created by j.bothwell on 22/04/2015.
- Author
- j.bothwell
- Language
- English
- Views
- 5
- Rating
- No ratings yet Rate this quiz