Question
A table contains 1,000,000 records, and a B+ tree index built on it has a fan-out (branching order) of exactly 100 at each internal node. What is the approximate height of this B+ tree?
More IT DBMS Questions
- What is referential integrity?
- Which of the following concurrency control methods avoids deadlocks entirely but can reduce concurrency by blocking transactions at start?
- Transaction T1 holds a lock on resource A and requests a lock on resource B. Transaction T2 holds a lock on resource B and requests a lock on resource A. B...
- Under READ COMMITTED isolation, Transaction T1 executes a query 'SELECT * FROM Accounts WHERE balance > 50000' and gets 5 rows. Before T1 re-executes the i...
- Which of the following is a DML command?
- R(StudentID, CourseID) records every course each student has taken. S(CourseID) lists all courses required for a certain certification. Which relational al...
- Which of the following is a property of a relational database?
- A relation R(A, B, C, D, E) has the composite candidate key {A, B}, and the functional dependencies AB→C, AB→D, and AB→E hold. No other functional dependen...
- In paging, the page size is defined by:
- Which DBMS command is used to remove a table completely along with its structure?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)