Register
Filter

Questions by manvi_agarwal

5 votes
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
0 votes
0 answers
2
MadeEasy Workbook: Algorithms - Graph Algorithms
Approach for Q8 and Q9 please
Approach for Q8 and Q9 please
0 votes
0 answers
3
Algorithm and data structure
https://gateoverflow.in/?qa=blob&qa_blobid=17275535249024428371
https://gateoverflow.in/?qa=blob&qa_blobid=17275535249024428371
0 votes
1 answer
4
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 votes
2 answers
5
Made easy , divide and conquer
https://gateoverflow.in/?qa=blob&qa_blobid=11583750777176064728 Approach please
https://gateoverflow.in/?qa=blob&qa_blobid=11583750777176064728Approach please
1 votes
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
0 votes
2 answers
7
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 votes
1 answer
8
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
0 votes
1 answer
10
MadeEasy Workbook: Programming & DS - Queues
https://gateoverflow.in/?qa=blob&qa_blobid=10936115150698131975
https://gateoverflow.in/?qa=blob&qa_blobid=10936115150698131975