Question
A table contains 8,000,000 records, and a B+ tree index built on it has a fan-out (branching order) of exactly 200 at each internal node. What is the approximate height of this B+ tree?
More IT DBMS Questions
- A program needs to process elements from a `Queue` until it becomes empty. Which control flow structure is most suitable for this task?
- Which of the following correctly describes a 'primary key' in a relational database?
- Query optimization heuristic that “pushes selections down” improves:
- Two transactions T1 and T2 both follow the Two-Phase Locking (2PL) protocol. T1 acquires an exclusive lock on row A and then requests a lock on row B, whil...
- A relation Student_Course(StudentID, CourseID, StudentName, CourseName) stores StudentName redundantly in every row for each course a given student takes. ...
- Consider the schedule S: R1(A); W2(A); R1(B); W2(B); W1(A), involving transactions T1 and T2. Is this schedule conflict serializable?
- Which of the following is NOT a common type of error encountered during software development?
- Which normal form ensures that every determinant is a candidate key?
- Transaction T1 holds a lock on Row A and requests a lock on Row B. Transaction T2 holds a lock on Row B and requests a lock on Row A. Both use strict Two-P...
- Given relations Enrolled(Student, Course) and AllCourses(Course), which relational algebra operation correctly finds students enrolled in ALL courses liste...
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)