GkSeries.com

Home/
Computer Engineering/
Maximum height of a B+ tree of order m with n key values is :

By Gkseries see more questions

Q.

Maximum height of a B+ tree of order m with n key values is :

[A] log m(n)

[B] (m+n)/2

[C] log_m/2(m+n)

[D] log_(1/2m)(n+1/2)

Answer & Explanation
Option: [D]

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

Please share this page

DATABASE MANAGEMENT SYSTEM MULTIPLE CHOICE QUESTIONS & ANSWERS – E-BOOK

Click Here to Read more questions

Teacher Eligibility Test