× Didn't find what you were looking for? Ask a question
Top Posters
Since Sunday
r
4
L
4
3
d
3
M
3
l
3
V
3
s
3
d
3
a
3
g
3
j
3
New Topic  
Star4567980 Star4567980
wrote...
Posts: 699
Rep: 0 0
6 years ago
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
Read 73 times
1 Reply

Related Topics

Replies
wrote...
6 years ago
a
New Topic      
Explore
Post your homework questions and get free online help from our incredible volunteers
  1692 People Browsing
Related Images
  
 128
  
 264
  
 341
Your Opinion
Who will win the 2024 president election?
Votes: 119
Closes: November 4