Register
Filter

Recent activity by Atharva007

6 answers
2
GATE CSE 2017 Set 2 | Question: 30
Consider the recurrence function $T(n) = \begin{cases} 2T(\sqrt{n})+1, & n>2 \\ 2, & 0 < n \leq 2 \end{cases}$ Then $T(n)$ in terms of $\Theta$ notation is $\Theta(\log \log n)$ $\Theta( \log n)$ $\Theta (\sqrt{n})$ $\Theta(n)$
Consider the recurrence function$$T(n) = \begin{cases} 2T(\sqrt{n})+1, & n>2 \\ 2, & 0 < n \leq 2 \end{cases}$$Then $T(n)$ in terms of $\Theta$ notation is$\Theta(\log \l...
8 answers
4
GATE IT 2005 | Question: 23, ISRO2017-67
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are $5$ $4$ $3$ $2$
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes tha...