Table of Algorithms 2

1. 1The depth-first search has which time complexity?

   1. AConstant
   2. BLogarithmic
   3. CLinear
   4. DSuperlinear
   5. EQuadratic
   6. FCubic
   7. GExponential
   8. HFactorial
2. 2The CSP generate-and-test has which time complexity?

   1. AConstant
   2. BLogarithmic
   3. CLinear
   4. DSuperlinear
   5. EQuadratic
   6. FCubic
   7. GExponential
   8. HFactorial
3. 3The time complexity of the tail-recursive Alg is?

   1. AConstant
   2. BLogarithmic
   3. CLinear
   4. DSuperlinear
   5. EQuadratic
   6. FCubic
   7. GExponential
   8. HFactorial
4. 4The iterative fibonacci has which space complexity?

   1. AO(1)
   2. BO(logn)
   3. CO(n)
   4. DO(nlogn)
   5. EO(n^2)
   6. FO(n^3)
   7. GO(2n)
   8. HO(n!)
5. 5The recursive euclidean has which space complexity?

   1. AO(1)
   2. BO(logn)
   3. CO(n)
   4. DO(nlogn)
   5. EO(n^2)
   6. FO(n^3)
   7. GO(2n)
   8. HO(n!)
6. 6The iterative fibonacci has which time complexity?

   1. AO(1)
   2. BO(logn)
   3. CO(n)
   4. DO(nlogn)
   5. EO(n^2)
   6. FO(n^3)
   7. GO(2n)
   8. HO(n!)
7. 7Which of the following algorithms have an exponential worst-case time complexity?

   1. APermutation Generator
   2. BTail-Recursive Factorial
   3. CSelection Sort
   4. DRecursive Tribonacci
   5. EQuick Sort
   6. FInsertion Sort
   7. GRecursive Eucledian
   8. HRecursive Array Sum
   9. IRecursive Fibonacci
   10. JIterative Factorial
8. 8The insertion sort has worst case time complexity of?

   1. AO(1)
   2. BO(logn)
   3. CO(n)
   4. DO(nlogn)
   5. EO(n^2)
   6. FO(n^3)
   7. GO(2n)
   8. HO(n!)
9. 9The recursive fibonacci has which space complexity?

   1. AO(1)
   2. BO(logn)
   3. CO(n)
   4. DO(nlogn)
   5. EO(n^2)
   6. FO(n^3)
   7. GO(2n)
   8. HO(n!)
10. 10The recursive Bigsum has which space complexity?

    1. AConstant
    2. BLogarithmic
    3. CLinear
    4. DSuperlinear
    5. EQuadratic
    6. FCubic
    7. GExponential
    8. HFactorial

11. 11The mergesort algorithm has which space complexity?

    1. AO(1)
    2. BO(logn)
    3. CO(n)
    4. DO(nlogn)
    5. EO(n^2)
    6. FO(n^3)
    7. GO(2n)
    8. HO(n!)
12. 12The first order unification has which time complexity?

    1. AConstant
    2. BLogarithmic
    3. CLinear
    4. DSuperlinear
    5. EQuadratic
    6. FCubic
    7. GExponential
    8. HFactorial
13. 13The insertionsort has which space complexity?

    1. AO(1)
    2. BO(logn)
    3. CO(n)
    4. DO(nlogn)
    5. EO(n^2)
    6. FO(n^3)
    7. GO(2n)
    8. HO(n!)
14. 14The iterative factorial has which space complexity?

    1. AO(1)
    2. BO(logn)
    3. CO(n)
    4. DO(nlogn)
    5. EO(n^2)
    6. FO(n^3)
    7. GO(2n)
    8. HO(n!)
15. 15The recursive tribonacci has which time complexity?

    1. AO(1)
    2. BO(logn)
    3. CO(n)
    4. DO(nlogn)
    5. EO(n^2)
    6. FO(n^3)
    7. GO(2n)
    8. HO(n!)
16. 16The best-case time complexity of insertion sort is?

    1. AO(1)
    2. BO(logn)
    3. CO(n)
    4. DO(nlogn)
    5. EO(n^2)
    6. FO(n^3)
    7. GO(2n)
    8. HO(n!)
17. 17The mergesort algorithm has which time complexity?

    1. AO(1)
    2. BO(logn)
    3. CO(n)
    4. DO(nlogn)
    5. EO(n^2)
    6. FO(n^3)
    7. GO(2n)
    8. HO(n!)
18. 18The first order unification has which space complexity?

    1. AConstant
    2. BLogarithmic
    3. CLinear
    4. DSuperlinear
    5. EQuadratic
    6. FCubic
    7. GExponential
    8. HFactorial
19. 19The tail-recursive fibonacci has which space complexity?

    1. AO(1)
    2. BO(logn)
    3. CO(n)
    4. DO(nlogn)
    5. EO(n^2)
    6. FO(n^3)
    7. GO(2n)
    8. HO(n!)
20. 20The recursive factorial has which space complexity?

    1. AO(1)
    2. BO(logn)
    3. CO(n)
    4. DO(nlogn)
    5. EO(n^2)
    6. FO(n^3)
    7. GO(2n)
    8. HO(n!)
21. 21The permutation generator has which worst-case space complexity?

    1. AO(1)
    2. BO(logn)
    3. CO(n)
    4. DO(nlogn)
    5. EO(n^2)
    6. FO(n^3)
    7. GO(2n)
    8. HO(n!)
22. 22The iterative tribonacci algorithm has which space complexity?

    1. AO(1)
    2. BO(logn)
    3. CO(n)
    4. DO(nlogn)
    5. EO(n^2)
    6. FO(n^3)
    7. GO(2n)
    8. HO(n!)
23. 23The quicksort algorithm has which best-case space complexity?

    1. AO(1)
    2. BO(logn)
    3. CO(n)
    4. DO(nlogn)
    5. EO(n^2)
    6. FO(n^3)
    7. GO(2n)
    8. HO(n!)
24. 24The selectionsort algorithm has which space complexity?

    1. AO(1)
    2. BO(logn)
    3. CO(n)
    4. DO(nlogn)
    5. EO(n^2)
    6. FO(n^3)
    7. GO(2n)
    8. HO(n!)
25. 25The SLD-resolution has which time complexity?

    1. AConstant
    2. BLogarithmic
    3. CLinear
    4. DSuperlinear
    5. EQuadratic
    6. FCubic
    7. GExponential
    8. HFactorial

Descripción

Test sobre Table of Algorithms 2, creado por j.bothwell el 22/04/2015.

Autor

j.bothwell

Idioma

English

Visitas

7

Valoración

Aún sin valoraciones

Valora este test

Valora este test

Más sobre Algorithm Analysis and Complexity