Explore BrainMass
Share

Contiguous, Linked, Indexed Strategy

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume that the information about each file is already in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer these questions:

1. How is the logical-to-physical address mapping accomplished in this system? (For the indexed allocation, assume that a file is always less than 512 blocks long.)

2. If we are currently at logical block 10 (the last block accessed was block 10 ) and want to access logical block 4, how many physical blocks must be read from the disk?

© BrainMass Inc. brainmass.com October 25, 2018, 3:54 am ad1c9bdddf
https://brainmass.com/computer-science/linked-lists/contiguous-linked-indexed-strategy-358518

Solution Preview

Let X is the starting address of the file

a. Contiguous:- Now, since files are stored in contiguous memory block , the file system only stores the starting address of the file

i. To reach to X, We first need to divide it by 512.
Y=X/512 -> Y+X will give us the starting of the block.
Z=X%512 -> Z will be the displacement in that block.

ii. Since, files are stored in contiguous block we will need to make just 1 read to go to block 4 from block 10.(We know that it is 6 blocks away from this block , so we can directly ...

Solution Summary

For each of the three allocation strategies (contiguous, linked, and indexed), the solution answers various questions.

$2.19
See Also This Related BrainMass Solution

Recruiting method

What are some internal and external ways that I could recruit for a teaching position. What will be the advantages and disadvantages of each recruiting method? What steps are involved in the recruitment process? What are some effective retention methods?

View Full Posting Details