Recent activity by manvi_agarwal

1 answer
1
Also let me know the approach to find back edges, cross edges, forward edges,How to solve these questions
0 answers
3
https://gateoverflow.in/?qa=blob&qa_blobid=17275535249024428371
2 answers
4
1 answer
5
Is the answer to this solution is O( n2 log (n) ) or O( n log (n) )
2 answers
6
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 answers
8
Solution using back substitution methodT(n) = 2T(n/2) + nlogn ?detailed solution please.ans is nlognlogn or n(logn)^2
1 answer
9
which is an efficient tree structure in terms of space and time complexity?a) AVL Treeb)Full Binary treec)Complete binary treed)Binary tree
1 answer
10
https://gateoverflow.in/?qa=blob&qa_blobid=10936115150698131975