Dark Mode

Recent activity by Daniyal89

0 answers

1

fractional knapsack
What is the time complexity of fractional knapsack if implemented using max-heap?

commented in Algorithms Oct 9, 2018

179 views

1 answer

2

ace test 4
ans given is option A

asked in Algorithms Oct 8, 2018

579 views

1 answer

3

ACE algo test series
Ans given is option-B

commented in Algorithms Sep 30, 2018

367 views

0 answers

4

made easy test series
Is there is any good method or procedure to solve this question? or else I have to try by brute force ,,,like try 1st 0,1,2,3... length string

commented in Theory of Computation Sep 19, 2018

168 views

2 answers

5

made easy test series
Can someone Explain these statements?

answer selected in Theory of Computation Sep 18, 2018

488 views

0 answers

6

made easy booklet
Find time complexity? a) T(n) = T(n/2) + pow(2,n) b) T(n) = T(pow(n,1/2)) + n c) T(n) = 16T(n/4) + n! d) T(n) = pow(2,1/2)*T(n/2) + log n can we apply master theorem on the above problem?

commented in Algorithms Sep 18, 2018

2.2k views

1 answer

7

ace test series

commented in Theory of Computation Sep 18, 2018

328 views

0 answers

8

made easy test series
Is there is any good method or procedure to solve this question? or else I have to try by brute force...

asked in Theory of Computation Sep 18, 2018

78 views

1 answer

9

Extended Master's Theorem $T(n)=n^{1/2}T(n^{1/2})+n$
Can Extended Masters theorem be applied to the following recursive equation ? $T(n)=n^{1/2}T(n^{1/2})+n$ I solved this using back substitution and the time complexity came out to be $O(n*(loglogn))$ I was wondering if this ... masters theorem, like the way Tauhin Gangwar has solved here - https://gateoverflow.in/60532/find-tc-t-n-2t-n-1-2-1

commented in Algorithms Sep 17, 2018

2.7k views

0 answers

10

commented in Theory of Computation Sep 17, 2018

180 views

0 answers

11

commented in Theory of Computation Sep 17, 2018

108 views

0 answers

12

ace test series

asked in Theory of Computation Sep 16, 2018

138 views