This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Answer: i) Starting from 35, the order is: 37, 29, 13, 2, 48, 50, which gives 2 + 8 + 16 + 11 + 46 + 2 = 85 cylinders visited. ii) Starting from 35, the order is: 37, 48, 50, 29, 13, 2, which gives 2 + 11 + 2 + 21 + 16 + 11 = 63 cylinders visited. 2. (2 pts) Which data structure can potentially reduce the amount of disk arm motion if used for keeping the list of free blocks on a disk? Explain. Answer: Acceptable answers: bitmap, File Allocation Table (FAT), and linked lists (as long as keeps the size of the contiguous chunk of free blocks in each node). By the way, the linked list implementation that is discussed in the textbook in Section 6.3 Keeping Track of Free Blocks cannot guarantee ﬁnding contiguous free disk blocks). 2...
View Full Document
- Fall '07
- Operating Systems, Prime number, File Allocation Table, Array data structure, Elevator algorithm, free blocks