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
- Shadow Paging avoids:
- What is a 'foreign key' in a relational database?
- Which debugging tool allows a developer to pause program execution at specific lines, inspect variable values, and execute code step-by-step?
- Which of these ensures referential integrity?
- In a relation with a composite candidate key, a functional dependency X→Y is called a 'partial dependency' when:
- What will be the output of the following Python code: a=[1,2,3,4,5,6] print(a[-1],a[-1:],a[:-1])
- Which normal form eliminates transitive dependency?
- What does re.sub(r'(\w+)', r'_\1_', 'hello world') return?
- Which of the following illustrates an advantage of DBMS over traditional file systems?
- In SQL, which clause is used to filter groups of rows after aggregate functions (such as SUM, COUNT, or AVG) have been applied?
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)