0 votes
2 answers
66
What is the time complexity of the following function: function(n) { for(i = 0; i < n; i = i*2) { for(j = 0; j < i; j++) { printf("*"); } } }
2 votes
1 answer
67
How can we compute the $\Theta$ time complexity of the following recurrence relation:$T(n)=T(n/2)+T(n/4)+T(n/8)+n​$
0 votes
2 answers
68
How will you perform asymptotic comparison of the following three functions:​1. $\log{n}$,2. $(\log{n})^c$ and3. $\sqrt{n}$Obviously $\log{n} < (\log{n})^c$. But where ...
1 votes
1 answer
69
Which of the following is false?A. Maximum height of an AVL tree of n nodes is 1.44 log2n&#8203;B. Insertion of an element into an AVL tree requires at most a double rot...
1 votes
4 answers
71
The tree given is as follows: 40 / \ 35 53 / \ 20 60 How many rotations are required for insertion of elements 30,55,45,6...