Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged goclasses-da-dpp-day-239
2
2 votes
1
1 answer
277
277 views
GO Classes DPP | GATE CS, DA | Algorithms | Master's Theorem
Solve the recurrence:$T(n) = 4T(n/2) + n^2$$\Theta(n^2)$ $\Theta(n^2\log n)$ $\Theta(n^{\log_2 4})$ $\Theta(n^3)$
GO Classes
277
views
asked
Jul 29
Algorithms
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-239
goclasses-cs-dpp
goclasses-cs-dpp-day-337
algorithms
python-&-dsa
goclasses-python-&-dsa-practice-questions
goclasses-algo-practice-questions
master-theorem
+
–
3
3 votes
1
1 answer
194
194 views
GO Classes DPP | GATE CS, DA | Algorithms | Master's Theorem
Solve the recurrence:$T(n) = 7T(n/2) + n^3$$\Theta(n^{\log_2 7})$ $\Theta(n^3)$ $\Theta(n^3\log n)$ $\Theta(n^2)$
GO Classes
194
views
asked
Jul 29
Algorithms
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-239
goclasses-cs-dpp
goclasses-cs-dpp-day-337
algorithms
python-&-dsa
goclasses-python-&-dsa-practice-questions
goclasses-algo-practice-questions
master-theorem
+
–
2
2 votes
1
1 answer
177
177 views
GO Classes DPP | GATE CS, DA | Algorithms | Master's Theorem
Solve the recurrence:$T(n) = 10T(n/3) + 17n^{1.2}$ $O(n^{1.2})$ $O(n^{\log_3 10})$ $O(n^{1.2}\log n)$ $O(n^3)$
GO Classes
177
views
asked
Jul 29
Algorithms
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-239
goclasses-cs-dpp
goclasses-cs-dpp-day-337
algorithms
python-&-dsa
goclasses-python-&-dsa-practice-questions
goclasses-algo-practice-questions
master-theorem
+
–
2
2 votes
1
1 answer
182
182 views
GO Classes DPP | GATE CS, DA | Algorithms | Master's Theorem
Solve the recurrence:$T(n) = 3T(n/5) + (\log n)^2$ $O((\log n)^2)$ $O(n^{\log_5 3})$ $O(n)$ $O(n\log n)$
GO Classes
182
views
asked
Jul 29
Algorithms
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-239
goclasses-cs-dpp
goclasses-cs-dpp-day-337
algorithms
python-&-dsa
goclasses-python-&-dsa-practice-questions
goclasses-algo-practice-questions
master-theorem
+
–
To see more, click for the
full list of questions
or
popular tags
.