Algorithm Quiz 3
Authored by Sivaranjani RS
Other
University
Used 1+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
5 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the solution to the recurrence relation T(n) = T(n/2) + 1?
A. T(n) = logn
B. T(n) = nlogn
C. T(n) = n
D. T(n) = 1
2.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
Which method can be used to solve the recurrence relation T(n) = 2T(n/2) + n?
A. Substitution method
B. Iteration method
C. Master theorem
D. Factorial method
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the solution to the recurrence relation T(n) = 3T(n/3) + n?
A. T(n) = nlogn
B. T(n) = n
C. T(n) = n^2
D.T(n) = logn
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the solution to the recurrence relation T(n) = T(n-1) + 1, where T(1) = 1?
A. T(n) = n
B. T(n) = n-1
C. T(n) = 1
D. T(n) = 2^n
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the solution to the recurrence relation T(n) = 3T(n/3 - 1) + n?
A. T(n) = nlogn
B. T(n) = n
C. T(n) = n^2
D. T(n) = logn
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Classlink
Continue with Clever
or continue with
Microsoft
%20(1).png)
Apple
Others
Already have an account?
