Question
A file of 10,000 fixed-length records of 128 bytes each is stored sorted on its key in disk blocks of 1024 bytes (unspanned). How many block accesses are needed in the worst case to find a record using binary search on the file?
More IT DBMS Questions
- Transaction T1 holds a lock on resource A and requests a lock on resource B. Transaction T2 holds a lock on resource B and requests a lock on resource A. B...
- Which of the following is NOT a common type of error encountered during software development?
- In a 'clustered' index on a database table, what distinguishes it from a non-clustered index?
- Which debugging tool allows a developer to pause program execution at specific lines, inspect variable values, and execute code step-by-step?
- What is the maximum number of processes that can be in the Ready state?
- A table Orders(order_id, customer_id, order_date, amount) needs a query that returns each order alongside a running cumulative total of that customer's ord...
- A software defect that causes a program to produce incorrect output without crashing or displaying an error message is typically classified as a:
- Shadow Paging avoids:
- Given Employee(EmpID, Name, DeptID) and Department(DeptID, DeptName), which relational algebra expression correctly retrieves the names of employees workin...
- What is a 'transaction' in DBMS and what does 'COMMIT' do?
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)