Register

Recent questions tagged goclasses-cs-dpp-day-65

1 1 vote
3 answers 3 answers
527
527 views
GO Classes DPP | Algorithms | Recurrence Relation
Consider the following recurrence relation:$$\mathrm{T}(\mathrm{n})=\sqrt{n} \cdot \log \mathrm{n}+\mathrm{T}(\mathrm{n} / 2), \mathrm{T}(1)=1$$The above recurrence is eq...
User Avatar
2 2 votes
2 answers 2 answers
471
471 views
GO Classes DPP | Algorithms | Recurrence Relation
What is the time complexity of the following recursive function? int DoSomething (int n) { if (n <= 2) return 1; else for( i=1 to sqrt{log n} ) ...
User Avatar
2 2 votes
2 answers 2 answers
377
377 views
GO Classes DPP | Algorithms | Recurrence Relation
Consider the following program:function GO_Recursion(n): if n <= 1: return for i=1 to n: doConstantWork() // O(1) for j=1 to 5: GO_Recursion(n/3)Which of the ...
User Avatar
1 1 vote
3 answers 3 answers
394
394 views
GO Classes DPP | Algorithms | Recurrence Relation
Solve the following recurrences.$$T(n)=2 T(n-2), T(0)=1, T(1)=1 .$$(Here $\Theta$ represents big-theta.)$\Theta\left((\sqrt{ 2})^n\right)$ $\Theta\!\left(\sqrt{2^n}\right...
User Avatar
1 1 vote
3 3 answers
452
452 views
GO Classes DPP | Algorithms | Recurrence Relation
Suppose that the function F is defined for all powers of $2$ and is described by the following recurrence equation and base case: $F(n)=n-2+2 F(n / 2), F(1)=1$ respective...
User Avatar
To see more, click for the full list of questions or popular tags.