Dark Mode

Recent activity by manvi_agarwal

1 answer

1

Graph
Also let me know the approach to find back edges, cross edges, forward edges, How to solve these questions

commented in Algorithms Sep 16, 2018

2.0k views

0 answers

2

MadeEasy Workbook: Algorithms - Graph Algorithms
Approach for Q8 and Q9 please

commented in Algorithms Sep 15, 2018

260 views

0 answers

3

Algorithm and data structure
https://gateoverflow.in/?qa=blob&qa_blobid=17275535249024428371

commented in Algorithms Sep 11, 2018

347 views

2 answers

4

Made easy , divide and conquer
https://gateoverflow.in/?qa=blob&qa_blobid=11583750777176064728 Approach please

commented in Algorithms Sep 3, 2018

431 views

1 answer

5

Divide and conquer made easy
Is the answer to this solution is O( n2 log (n) ) or O( n log (n) )

commented in Algorithms Sep 3, 2018

819 views

2 answers

6

MadeEasy Subject Test: Algorithms - Recurrence
which of the following cannot be solved using masters theorem? a) T(n) = 2T(n/2) + n/logn b) T(n) = 2T(n/2) + logn c)T(n)=T(n/2)+logn d) non of these

commented in Algorithms Aug 13, 2018

1.6k views

1 answer

7

MadeEasy Workbook
https://gateoverflow.in/?qa=blob&qa_blobid=11435838562783483664 Approach for Q9 please . (Please note: it is the last question on left hand side, and part of it is written on right hand side) Answer is d, but according to me it should be b as in 3 situation ... but won't be restored in it's original state as mentioned in question. So only 1 and 2 is possible. Is it correct?

commented in DS Aug 10, 2018

1.6k views

2 answers

8

masters theorem
Solution using back substitution method T(n) = 2T(n/2) + nlogn ? detailed solution please. ans is nlognlogn or n(logn)^2

asked in Algorithms Aug 10, 2018

701 views

1 answer

9

madeeasy
which is an efficient tree structure in terms of space and time complexity? a) AVL Tree b)Full Binary tree c)Complete binary tree d)Binary tree

asked in DS Aug 4, 2018

693 views

1 answer

10

MadeEasy Workbook: Programming & DS - Queues
https://gateoverflow.in/?qa=blob&qa_blobid=10936115150698131975

asked in DS Jul 30, 2018

235 views