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
- A relation Employee(EmpID, Skill, Language) records that an employee can have multiple independent skills and can speak multiple independent languages, wit...
- 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 appro...
- What does the 'principle of least privilege' mean in information security?
- Which of the following is a type of database index?
- Relation R(Student, Course, Hobby) stores every course a student takes and every hobby they have, independently of each other, producing a full cross-produ...
- Which SQL clause is used to group rows based on one or more columns?
- Which of the following is a transaction property ensuring all steps are completed or none?
- Query optimization heuristic that “pushes selections down” improves:
- ACID properties in DBMS ensure:
- Which of the following is a weak entity in a database?
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)