Neco 2020 Data Processing Question 12

Practice objective / multiple choice question 12 from the 2020 Neco Data Processing examination.

Neco 2020 Data Processing Objective / Multiple Choice Medium Difficulty
Question 12 NECO • 2020 • DATA_PROCESSING • objective

An unindexed file contains 10,000 records, each 100 bytes. The block size is 512 bytes. A B+\-tree index of order 100 is built on the file. (a) How many block reads are required, on average, to locate a record by sequential search? (b) How many block reads are needed using the index? (c) Which method is faster for record retrieval?

Answer Options

Correct Answer A. Sequential average reads: 1001 blocks; Index reads: 2 blocks; Indexing is faster
B. Sequential average reads: 1001 blocks; Index reads: 5 blocks; Indexing is faster
C. Sequential average reads: 2000 blocks; Index reads: 2 blocks; Indexing is faster
D. Sequential average reads: 1001 blocks; Index reads: 2 blocks; Sequential search is faster
Correct Answer
A
Correct Option:
Sequential average reads: 1001 blocks; Index reads: 2 blocks; Indexing is faster

About This Question

This is Neco 2020 Data Processing Question 12. It is one of the objective questions from the 2020 Neco Data Processing examination.

Difficulty level: Medium .

View More Neco 2020 Data Processing Questions More Neco Practice Questions Back to Questions

Master the Exam!

You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.

Unlock Full Access Available for Android & Windows
Chat with Support