Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) DBMS File Organization and Indexing Indexing

Consider a B-tree of height h, minimum degree t ≥ 2 that contains any n-key, where n ≥ 1. Which of the following is correct?

1
h ≥ logt\(\rm\frac{n+1}{2}\)
2
h ≤ logt\(\rm\frac{n+1}{2}\)
3
h ≥ logt\(\rm\frac{n−1}{2}\)
4
h ≤ logt\(\rm\frac{n−1}{2}\)
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters