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
- ACID properties in DBMS ensure:
- Which of the following is NOT a type of database model?
- A programmer is trying to debug an issue where an `ArrayList` (or equivalent dynamic array) in their Java/Python code unexpectedly throws an `IndexOutOfBo...
- Which of the following is NOT a common type of error encountered during software development?
- A relation R(A, B, C, D, E) has the functional dependencies AB→C, C→D, D→E, and E→A. Assuming AB is the only candidate key of R, which normal form does R s...
- Query optimization heuristic that “pushes selections down” improves:
- Relation R has 20 tuples and relation S has 15 tuples, with no common attributes between them. What is the cardinality (number of resulting tuples) of R x ...
- Consider the schedule S: r1(A), r2(A), w1(A), w2(A) of transactions T1 and T2. Which statement about S is correct?
- Which SQL constraint ensures that a column cannot have NULL values?
- A relation Student_Course(StudentID, CourseID, StudentName, CourseName) stores StudentName redundantly in every row for each course a given student takes. ...
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)