Table of Algorithms 3

1. 1The recursive 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!)
2. 2The recursive arraysum 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!)
3. 3Which of the following algorithms have the same worst-case space complexity and worst-case time complexity?

   1. ARecursive Eucledian
   2. BSelection Sort
   3. CInsertion Sort
   4. DRecursive Factorial
   5. ERecursive Tribonacci
   6. FIterative Array Sum
   7. GRecursive Fibonacci
   8. HIterative Factorial
   9. ITail-Recursive Fibonacci
   10. JMerge Sort
4. 4The best-first search has which time complexity?

   1. AConstant
   2. BLogarithmic
   3. CLinear
   4. DSuperlinear
   5. EQuadratic
   6. FCubic
   7. GExponential
   8. HFactorial
5. 5The quicksort algorithm has worst-case space 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!)
6. 6The time complexity of the A* search is?

   1. AConstant
   2. BLogarithmic
   3. CLinear
   4. DSuperlinear
   5. EQuadratic
   6. FCubic
   7. GExponential
   8. HFactorial
7. 7The tail-recursive tribonacci 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!)
8. 8The recursive arraysum 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!)
9. 9The quicksort algorithm has best-case space 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!)
10. 10Which of the following sorting algorithms have a superlinear average-case time complexity?

    1. ASelection Sort
    2. BInsertion Sort
    3. CMerge Sort
    4. DBubble Sort
    5. EQuick Sort
    6. FBogo Sort

11. 11The iterative arraysum 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!)
12. 12The iterative tribonacci 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!)
13. 13The quicksort algorithm 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!)
14. 14The SLD-resolution has which space complexity?

    1. AConstant
    2. BLogarithmic
    3. CLinear
    4. DSuperlinear
    5. EQuadratic
    6. FCubic
    7. GExponential
    8. HFactorial
15. 15The tail-recursive tribonacci 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!)
16. 16The recursive 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!)
17. 17Which of the following algorithms have a quadratic worst-case time complexity?

    1. ABubble Sort
    2. BMerge Sort
    3. CBogo Sort
    4. DBinary Tree Sort
    5. EInsertion Sort
    6. FQuick Sort
    7. GSelection Sort
18. 18The iterative arraysum 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!)
19. 19The best-first search has which space complexity?

    1. AConstant
    2. BLogarithmic
    3. CLinear
    4. DSuperlinear
    5. EQuadratic
    6. FCubic
    7. GExponential
    8. HFactorial
20. 20The CSP backtracking search has which time complexity?

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

Description

Quiz on Table of Algorithms 3, created by j.bothwell on 22/04/2015.

Author

j.bothwell

Language

English

Views

6

Rating

No ratings yet

Rate this quiz

Rate this quiz

More on Algorithm Analysis and Complexity