Multiple Choice
When the storage allocation table uses ____ data structures sequential file access is very efficient but random access is much less efficient.
A) linked lists
B) B+ trees
C) binary trees
D) hash tables
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q31: The most common example of multiple RAID
Q32: Describe how secondary storage devices store bits,
Q33: The _ layer is the bridge between
Q34: If the logical record size is less
Q35: A(n) _ backup is a variation on
Q37: The relationship between file types and the
Q38: A limited-purpose server is sometimes called a
Q39: Among other things, _ type determines naming
Q40: A(n) _ path begins at the current
Q41: A laptop computer with Windows but no