Test
General Algorithms
Crea una cuenta gratis para terminar este test
Guarda tu progreso y consulta tu resultado final.
¿Ya tienes cuenta? Inicia sesión
Preguntas del test (30)
1What is the space complexity of Iterative Factorial?
- AO(n)
- BO(1)
- CO(log n)
- DO(n*n!)
2What is the Time complexity of Iterative Factorial?
- AO(2^n)
- BO(n log(n))
- CO(n)
- DO(n^2)
3What is the Space complexity of Recursive Factorial?
- AO(1)
- BO(n)
- CO(n^2)
- DO(log n)
4What is the Time complexity of Recursive factorial?
- AO(n)
- BO(1)
- CO(log n)
- DO(2^n)
5What is the space complexity of Iterative Euclidean?
- AO(1)
- BO(n)
- CO(log n)
- DO(n*n!)
6What is the best case time complexity of Iterative Euclidean?
- AO(1)
- BO(n)
- CO(log n)
- DO(n^2)
7What is the average/worst case time complexity of Iterative Euclidean?
- AO(1)
- BO(n)
- CO(log n)
- DO(n^2)
8What's the space complexity of Recursive Euclidean?
- AO(1)
- BO(n)
- CO(log n)
- DO(n^2)
9What is the average case time complexity of Recursive Euclidean?
- AO(1)
- BO(n)
- CO(log n)
- DO(n^2)
10What is the space complexity of Iterative Array/Big Sum?
- AO(n*n!)
- BO(log n)
- CO(n)
- DO(1)
11What's the time complexity of iterative array/big sum?
- AO(n^2)
- BO(log n)
- CO(n)
- DO(1)
12What's the space complexity of recursive array/big sum?
- AO(n^2)
- BO(log n)
- CO(n)
- DO(1)
13What's the time complexity of recursive array/big sum?
- AO(n log n)
- BO(n)
- CO(1)
- DO(n^2)
14What's the space complexity of iterative OddNumber?
- AO(1)
- BO(n)
- CO(n^2)
- DO(log n)
15What's the time complexity of iterative OddNumber?
- AO(n)
- BO(n log n)
- CO(n^2)
- DO(n^3)
16What's the space complexity of recursive OddNumber?
- AO(log n)
- BO(1)
- CO(n)
- DO(n*n!)
17What's the time complexity of recursive OddNumber?
- AO(1)
- BO(log n)
- CO(n^3)
- DO(n)
18What's the space complexity of iterative Fibonacci?
- AO(n)
- BO(n^2)
- CO(2^n)
- DO(1)
19What's the time complexity of iterative Fibonacci?
- AO(2^n)
- BO(1)
- CO(n^2)
- DO(n)
20What's the space complexity of recursive Fibonacci?
- AO(1)
- BO(n)
- CO(2^n)
- DO(log n)
21What's the time complexity of recursive Fibonacci?
- AO(2^n)
- BO(n^2)
- CO(1)
- DO(n)
22What's the space complexity of tail recursive Fibonacci?
- AO(1)
- BO(n)
- CO(log n)
- DO(n log n)
23What's the time complexity of tail recursive Fibonacci?
- AO(1)
- BO(n)
- CO(2^n)
- DO(n^2)
24What's the space complexity of iterative Tribonacci?
- AO(n^3)
- BO(3^n)
- CO(1)
- DO(n)
25What's the time complexity of iterative Tribonacci?
- AO(1)
- BO(n)
- CO(n^3)
- DO(3^n)
26What's the space complexity of recursive Tribonacci?
- AO(1)
- BO(n)
- CO(3^n)
- DO(n^3)
27What's the time complexity of recursive Tribonacci?
- AO(1)
- BO(n)
- CO(n^3)
- DO(3^n)
28Which of the following algorithms space complexity belong to the class O(1)?
- AIterative Factorial
- BRecursive Factorial
- CIterative Euclidean
- DRecursive Euclidean
- ERecursive Array/Big Sum
- FIterative Fibonacci
- GRecursive Fibonacci
- HTail-Recursive Fibonacci
- IIterative Tribonacci
- JRecursive Tribonacci
29Which of the following algorithms space complexities belong to the class O(log n)
- ARecursive Factorial
- BRecursive Tribonacci
- CIterative Tribonacci
- DTail-Recursive Fibonacci
- EIterative Fibonacci
- FRecursive Fibonacci
- GIterative ArraySum
- HIterative Euclidean
- IRecursive Euclidean
- JRecursive OddNumber
30Which of the following algorithms have time complexity of class O(n)?
- AIterative Factorial
- BRecursive Factorial
- CIterative ArraySum
- DRecursive ArraySum
- EIterative Fibonacci
- FTail-Recursive Fibonacci
- GRecursive Fibonacci
- HRecursive Tribonacci
- IIterative Tribonacci
- JRecursive Euclidean
Información
- Descripción
- Test sobre General Algorithms, creado por Kimberley McCann el 26/04/2015.
- Autor
- Kimberley McCann
- Idioma
- English
- Visitas
- 0
- Historial
- Creado el 26 abr 2015 · actualizado el 19 feb 2016
- Valoración
- Aún sin valoraciones Valora este test