retagged by
2,606 views
1 votes
1 votes

The upper bound and lower bound for the number of leaves in a B-tree of degree $K$ with height $h$ is given by : 

  1. $K^{h}$ and $2 \lceil \frac{k}{2} \rceil ^{h-1}$
  2. $K * h$ and $2 \lfloor \frac{k}{2} \rfloor ^{h-1}$
  3. $K^{h}$ and $2 \lfloor \frac{k}{2} \rfloor ^{h-1}$
  4. $K * h$ and $2 \lceil \frac{k}{2} \rceil ^{h-1}$
retagged by

1 Answer

Answer:

Related questions

0 votes
0 votes
2 answers
1
makhdoom ghaya asked Jul 1, 2016
3,400 views
Match the following $:$$\begin{array} {cIcI} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{DDL} & \text{i.} & \text{LOCK TABLE} \\ \text{b.} & \tex...
2 votes
2 votes
3 answers
2
makhdoom ghaya asked Jul 1, 2016
20,041 views
Let $R =\{A, B, C, D, E, F\}$ be a relation schema with the following dependencies $C \rightarrow F$, $E \rightarrow A$, $EC \rightarrow D$, $A \rightarrow B$. Which of t...
3 votes
3 votes
3 answers
3
makhdoom ghaya asked Jul 1, 2016
4,187 views
A clustering index is created when _______. Primary key is declared and ordered No key orderedForeign key orderedThere is no key and no order
0 votes
0 votes
2 answers
4
makhdoom ghaya asked Jul 1, 2016
10,713 views
Manager’s salary details are hidden from the employee. This is called asConceptual level data hidingPhysical level data hidingExternal level data hiding Local level...