Question
In indexing, which tree is most commonly used for disk-based indexing because it minimizes disk seeks and keeps nodes dense?
More IT DBMS Questions
- During transaction before commit which of the following statements is done automatically in case of shutdown?
- 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?
- A relational database management system needs to store millions of employee records on disk and support fast search, insertion, deletion, and range queries...
- A relation R(A, B, C, D) has the functional dependencies AB -> C, C -> D and D -> A. How many candidate keys does R have?
- 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?
- Consider the following Java-like pseudo-code for inserting a node into a Binary Search Tree (BST): ```java class Node { int data; ...
- Which type of join returns only matching records from both tables?
- T1 updates a row but has not committed; T2 reads that updated value; T1 then rolls back. What anomaly did T2 experience?
- What is the maximum number of processes that can be in the Ready state?
- Given the following Python-like code snippet: ```python class Counter: def __init__(self): self.count = 0 def in...
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)