Question
A B-tree index has an order of 100 (up to 100 children per node) and stores 1,000,000 records. Approximately what is the height of this B-tree?
More IT DBMS Questions
- Distributed 2-Phase Commit (2PC) can suffer from:
- In the context of debugging an Object-Oriented program, what does "stepping over" a method call typically do in a debugger?
- A relation R(A, B, C, D) has the functional dependencies AB → C, C → D and D → A. What is the highest normal form that R satisfies?
- Which SQL command is used to remove a table from the database?
- What will be the value of `x` after the following pseudo-code execution? ``` x = 0 data = [10, 20, 30] for item in data: if item ...
- Which SQL command removes all rows from a table quickly while preserving the table's structure for future use?
- Which of the following is a property of a relational database?
- Transaction T1 updates a row but has not yet committed. Transaction T2 reads this same row's uncommitted new value. T1 then rolls back, meaning T2 has read...
- Which type of SQL JOIN returns all rows from both tables involved, placing NULLs in columns where there is no matching row on the other side?
- Given a `Queue` data structure with `enqueue` and `dequeue` operations. What is the element returned by the last `dequeue` operation in the following seque...
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)