Free Exam: Analysis Quiz
Number of Questions in Test: 10
Number of Questions in Preview: 5
Register to view all questions.
Note: Answers are not shown below but will be copied with this test.
Copy this test to my quiz maker account
Register with ClassMarker to copy free tests to give to your Test takers.
Register nowQuestion 1
The solution of the recurrence: T(n) = 2T(n/3) + nlgn by given Θ - notation bound is
| Type: | Multiple choice |
| Points: | 1 |
| Randomize answers: | No |
Question 2
The solution of the recurrence: T(n) = T(n/2) + T(n/4) + T(n/8) + n by given Θ-notation bound is
| Type: | Multiple choice |
| Points: | 1 |
| Randomize answers: | No |
Question 3
The solution of the recurrence T(n) = √(n)T(√n) + 100n by given-notation bound
| Type: | Multiple choice |
| Points: | 1 |
| Randomize answers: | No |
Question 4
The solution of the recurrence: T(n) = T(n-2) + lgn by given Θ-notation bound is
| Type: | Multiple choice |
| Points: | 1 |
| Randomize answers: | No |
Question 5
The recurrence that describes the worstcase running time of Insertion sort algorithm is
| Type: | Multiple choice |
| Points: | 1 |
| Randomize answers: | No |