Neco 2017 Data Processing Question 50

Practice objective / multiple choice question 50 from the 2017 Neco Data Processing examination.

Neco 2017 Data Processing Objective / Multiple Choice Medium Difficulty
Question 50 NECO • 2017 • DATA_PROCESSING • objective

A file contains 10,000 records, each \(200\) bytes long. The disk block size is \(4,000\) bytes. An index can hold \(50\) pointers per block. For a multi‑level index, determine the number of index levels required and the total number of disk accesses needed to retrieve a single record. A B+‑tree of order \(100\) is also considered (each node can have up to \(100\) pointers). Assuming leaf nodes store the records themselves, compute the number of disk accesses needed to retrieve a record using the B+‑tree. Which structure gives the fewer accesses?

Answer Options

Correct Answer A. Multi‑level index: 3 accesses; B+‑tree: 2 accesses; B+‑tree is more efficient
B. Multi‑level index: 2 accesses; B+‑tree: 2 accesses; B+‑tree is more efficient
C. Multi‑level index: 3 accesses; B+‑tree: 3 accesses; Both structures are equally efficient
D. Multi‑level index: 4 accesses; B+‑tree: 2 accesses; Multi‑level index is more efficient
Correct Answer
A
Correct Option:
Multi‑level index: 3 accesses; B+‑tree: 2 accesses; B+‑tree is more efficient

About This Question

This is Neco 2017 Data Processing Question 50. It is one of the objective questions from the 2017 Neco Data Processing examination.

Difficulty level: Medium .

View More Neco 2017 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