Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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
Also let me know the approach to find back edges, cross edges, forward edges,How to solve these questions
2.5k
views
commented
Sep 16, 2018
Algorithms
algorithms
graph-algorithms
depth-first-search
descriptive
test-series
+
–
0
answers
2
MadeEasy Workbook: Algorithms - Graph Algorithms
Approach for Q8 and Q9 please
Approach for Q8 and Q9 please
481
views
commented
Sep 15, 2018
Algorithms
algorithms
graph-algorithms
+
–
0
answers
3
Algorithm and data structure
https://gateoverflow.in/?qa=blob&qa_blobid=17275535249024428371
https://gateoverflow.in/?qa=blob&qa_blobid=17275535249024428371
584
views
commented
Sep 11, 2018
Algorithms
data-structures
algorithms
binary-heap
+
–
2
answers
4
Made easy , divide and conquer
https://gateoverflow.in/?qa=blob&qa_blobid=11583750777176064728 Approach please
https://gateoverflow.in/?qa=blob&qa_blobid=11583750777176064728Approach please
672
views
commented
Sep 3, 2018
Algorithms
algorithms
divide-and-conquer
made-easy-test-series
+
–
1
answer
5
Divide and conquer made easy
Is the answer to this solution is O( n2 log (n) ) or O( n log (n) )
Is the answer to this solution is O( n2 log (n) ) or O( n log (n) )
1.0k
views
commented
Sep 3, 2018
Algorithms
divide-and-conquer
made-easy-test-series
+
–
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
which of the following cannot be solved using masters theorem?a) T(n) = 2T(n/2) + n/lognb) T(n) = 2T(n/2) + lognc)T(n)=T(n/2)+lognd) non of these
2.1k
views
commented
Aug 13, 2018
Algorithms
made-easy-test-series
recurrence-relation
master-theorem
+
–
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 ... but won't be restored in it's original state as mentioned in question. So only 1 and 2 is possible. Is it correct?
https://gateoverflow.in/?qa=blob&qa_blobid=11435838562783483664Approach for Q9 please .(Please note: it is the last question on left hand side, and part of it is written ...
2.0k
views
commented
Aug 10, 2018
DS
made-easy-booklet
data-structures
queue
see-later
+
–
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
Solution using back substitution methodT(n) = 2T(n/2) + nlogn ?detailed solution please.ans is nlognlogn or n(logn)^2
1.7k
views
asked
Aug 10, 2018
Algorithms
time-complexity
algorithms
master-theorem
asymptotic-notation
recurrence-relation
+
–
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
which is an efficient tree structure in terms of space and time complexity?a) AVL Treeb)Full Binary treec)Complete binary treed)Binary tree
878
views
asked
Aug 4, 2018
DS
data-structures
tree
+
–
1
answer
10
MadeEasy Workbook: Programming & DS - Queues
https://gateoverflow.in/?qa=blob&qa_blobid=10936115150698131975
https://gateoverflow.in/?qa=blob&qa_blobid=10936115150698131975
320
views
asked
Jul 29, 2018
DS
made-easy-workbook
data-structures
queue
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register