404 views
0 votes
0 votes

what is the minimum level of Btree index for storing 7500 keys and order of Btree is 6(order is maximum child pointer a node can have)________


my approach = $\left \lceil log_{5}7500 \right \rceil$ = 6

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
3
atulcse asked Jan 10, 2022
404 views
Consider the following schedule:R2(A), R1(A), R3(B), W3(B), W2(A), R1(A)Is the above schedule view serializable?
1 votes
1 votes
0 answers
4
Raviwarlord asked Jan 4, 2023
449 views
can anyone verify if options are correct i am not satisfied with the solution given.