Dark Mode

Questions by Daniyal89

3 votes

1 answer

1

ace test 4
ans given is option A

asked in Algorithms Oct 8, 2018

584 views

0 votes

1 answer

2

ACE algo test series
Ans given is option-B

asked in Algorithms Sep 30, 2018

370 views

1 vote

2 answers

3

made easy test series
Can someone Explain these statements?

asked in Theory of Computation Sep 18, 2018

493 views

0 votes

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...

asked in Theory of Computation Sep 18, 2018

79 views

0 votes

0 answers

5

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

asked in Theory of Computation Sep 18, 2018

172 views

1 vote

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?

asked in Algorithms Sep 16, 2018

2.2k views

1 vote

1 answer

7

ace test series

asked in Theory of Computation Sep 16, 2018

330 views

0 votes

0 answers

8

asked in Theory of Computation Sep 16, 2018

108 views

0 votes

0 answers

9

asked in Theory of Computation Sep 16, 2018

183 views

0 votes

0 answers

10

ace test series

asked in Theory of Computation Sep 16, 2018

139 views