Quiz
Table of Algorithms 2
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 (25)
1The depth-first search has which time complexity?
- AConstant
- BLogarithmic
- CLinear
- DSuperlinear
- EQuadratic
- FCubic
- GExponential
- HFactorial
2The CSP generate-and-test has which time complexity?
- AConstant
- BLogarithmic
- CLinear
- DSuperlinear
- EQuadratic
- FCubic
- GExponential
- HFactorial
3The time complexity of the tail-recursive Alg is?
- AConstant
- BLogarithmic
- CLinear
- DSuperlinear
- EQuadratic
- FCubic
- GExponential
- HFactorial
4The iterative fibonacci has which space complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
5The recursive euclidean has which space complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
6The iterative fibonacci has which time complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
7Which of the following algorithms have an exponential worst-case time complexity?
- APermutation Generator
- BTail-Recursive Factorial
- CSelection Sort
- DRecursive Tribonacci
- EQuick Sort
- FInsertion Sort
- GRecursive Eucledian
- HRecursive Array Sum
- IRecursive Fibonacci
- JIterative Factorial
8The insertion sort has worst case time complexity of?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
9The recursive fibonacci has which space complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
10The recursive Bigsum has which space complexity?
- AConstant
- BLogarithmic
- CLinear
- DSuperlinear
- EQuadratic
- FCubic
- GExponential
- HFactorial
11The mergesort algorithm has which space complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
12The first order unification has which time complexity?
- AConstant
- BLogarithmic
- CLinear
- DSuperlinear
- EQuadratic
- FCubic
- GExponential
- HFactorial
13The insertionsort has which space complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
14The iterative factorial has which space complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
15The recursive tribonacci has which time complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
16The best-case time complexity of insertion sort is?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
17The mergesort algorithm has which time complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
18The first order unification has which space complexity?
- AConstant
- BLogarithmic
- CLinear
- DSuperlinear
- EQuadratic
- FCubic
- GExponential
- HFactorial
19The tail-recursive fibonacci has which space complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
20The recursive factorial has which space complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
21The permutation generator has which worst-case space complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
22The iterative tribonacci algorithm has which space complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
23The quicksort algorithm has which best-case space complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
24The selectionsort algorithm has which space complexity?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2n)
- HO(n!)
25The SLD-resolution has which time complexity?
- AConstant
- BLogarithmic
- CLinear
- DSuperlinear
- EQuadratic
- FCubic
- GExponential
- HFactorial
Information
- Description
- Quiz on Table of Algorithms 2, created by j.bothwell on 22/04/2015.
- Author
- j.bothwell
- Language
- English
- Views
- 7
- Rating
- No ratings yet Rate this quiz