ECE 329: Chapter 12 - Allocation Strategies Questions - Prof. Stanley T. Birchfield, Assignments of Electrical and Electronics Engineering

Questions related to file allocation strategies, including contiguous, linked, and indexed allocation. Students are required to calculate the number of disk i/o operations for adding and removing blocks under different conditions for each strategy. Additionally, criteria for deciding which strategy is best for a particular file are discussed.

Typology: Assignments

Pre 2010

Uploaded on 07/28/2009

koofers-user-l5j-1
koofers-user-l5j-1 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE 329 Chapter 12 Questions
1. (3 pts.) Consider a file currently consisting of 100 blocks. Assume that the FCB is already in
memory. Calculate how many disk I/O operations are required for contiguous, linked, and
indexed (single-level) allocation strategies, if, for one block, the following conditions hold: 1) In
the contiguous-allocation case, assume that there is no room to grow the beginning, but there is
room to grow the end of the file. 2) Assume that the block information to be added is stored in
memory.
Contiguous Linked Indexed
a) A block is added at the beginning
b) A block is added in the middle
c) A block is added at the end.
d) A block is removed from the beginning.
e) A block is removed from the middle.
f) A block is removed from the end.
1. (3 pts.) Consider a system that supports contiguous, linked, and indexed allocation. What
criteria should be used in deciding which strategy is best for a particular file?

Partial preview of the text

Download ECE 329: Chapter 12 - Allocation Strategies Questions - Prof. Stanley T. Birchfield and more Assignments Electrical and Electronics Engineering in PDF only on Docsity!

ECE 329 Chapter 12 Questions

  1. (3 pts.) Consider a file currently consisting of 100 blocks. Assume that the FCB is already in memory. Calculate how many disk I/O operations are required for contiguous, linked, and indexed (single-level) allocation strategies, if, for one block, the following conditions hold: 1) In the contiguous-allocation case, assume that there is no room to grow the beginning, but there is room to grow the end of the file. 2) Assume that the block information to be added is stored in memory. Contiguous Linked Indexed a) A block is added at the beginning b) A block is added in the middle c) A block is added at the end. d) A block is removed from the beginning. e) A block is removed from the middle. f) A block is removed from the end.
  2. (3 pts.) Consider a system that supports contiguous, linked, and indexed allocation. What criteria should be used in deciding which strategy is best for a particular file?