Question

Suppose that a file requires 20 blocks to be stored in disk. For each of the...

Suppose that a file requires 20 blocks to be stored in disk. For each of the following allocation strategies( contiguous, linked, indexed), determine the number of disk block we need to read to bring in block 7 into memory after reading the file’s directory header?

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Contiguous Allocation => 1 Block

  • As directly will be having starting block and length, we can directly calculate the block address to be accessed.

Linked Allocation => 7 Blocks

  • We need to go block by block in linked allocation as directory will be having header block address only and then each block will be having subsequent block address.

Indexed => 2 Blocks

  • First Index Block
  • Second 7th Block
Add a comment
Know the answer?
Add Answer to:
Suppose that a file requires 20 blocks to be stored in disk. For each of the...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • How many disk accesses are needed to bring byte i of a file into memory when the file is stored u...

    How many disk accesses are needed to bring byte i of a file into memory when the file is stored using contiguous allocation? Assume only the file’s FCB is in memory , block pointers require 32 bits , and that blocks hold 4096 bytes each. 3 accesses 1 + [ i/4096] accesses [i/4096 accesses 2 accesses 1 access

  • Consider a file system on a disk that has both logical and physical block sizes of...

    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: If we are currently at logical block 5 (the last block accessed was blocked 4) and want to access logical block 15, how many physical blocks must be read from the disk?

  • 1 Mark Question Two Consider a file system on a disk that has both logical and...

    1 Mark Question Two Consider a file system on a disk that has both logical and physical block sizes of 512 tebytes. Assume that the information about each file is already in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer these at questions: a. 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.) b. If we are currently at...

  • How many disk accesses are needed to bring byte i of a file into memory when...

    How many disk accesses are needed to bring byte i of a file into memory when the file is stored using contiguous allocation? Assume only the file’s FCB is in memory , block pointers require 32 bits , and that blocks hold 4096 bytes each. 3 accesses 1 + [ i/4096] accesses [i/4096 accesses 2 accesses 1 access

  • How many disk accesses are needed to bring byte 4090 of a file into memory when the file is stored using double indirect indexed allocation? Assume that only the file's FCB is in memory, block po...

    How many disk accesses are needed to bring byte 4090 of a file into memory when the file is stored using double indirect indexed allocation? Assume that only the file's FCB is in memory, block pointers require 32 bits, and that blocks hold 1024 bytes each. How many disk accesses are needed to bring byte 4090 of a file into memory when the file is stored using double indirect indexed allocation? Assume that only the file's FCB is in memory,...

  • We know that there are different disk allocation methods that help the operating system decide how...

    We know that there are different disk allocation methods that help the operating system decide how disk blocks are allocated for files. In the contiguous disk allocation method, each file occupies a set of consecutive addresses on the disk. While this makes file allocation easier, an increase in the file size means that it has to be assigned elsewhere on the disk. The linked disk allocation method requires including a pointer in the current file, which points to the location...

  • Operating System Problem Three file allocation techniques for storing a file on disk, namely cont...

    Operating System Problem Three file allocation techniques for storing a file on disk, namely contiguous allocation, linked allocation, and indexed allocation. For each allocation method show how a file of 10 blocks would be allocated on disk. Note that the disk is represented as 30 blocks with blocks 0, 5, 6, 15, 25 already allocated. Note you must show the entire data structure for each allocation method as part of the answer. Thanks

  • Consider an empty 1 Gbyte disk with the block size of 4096 bytes. When the disk...

    Consider an empty 1 Gbyte disk with the block size of 4096 bytes. When the disk is formatted blocks 0 is occupied for system-related information. The system always allocated free blocks starting st the lowest numbered block, and it uses non-contiguous allocation. Question 6 (2, 4) Consider an empty 1 Gbyte disk with the block size of 4096 bytes. When the disk is formatted blocks 0 is occupied for system-related information. The system always allocates free blocks starting at the...

  • Consider a file system that uses inodes to represent files. Disk blocks are 4-KB in size...

    Consider a file system that uses inodes to represent files. Disk blocks are 4-KB in size and a pointer to a disk block requires 4 bytes. This file system has 12 direct disk blocks, plus two single indirect disk blocks. What is the maximum size of a file that can be stored in this file system? A single indirect disk block points to a block where its whole space is used to point to data blocks. Please explain it as...

  • Suppose we want to read k blocks that are randomly placed/stored in a disk cylinder i....

    Suppose we want to read k blocks that are randomly placed/stored in a disk cylinder i. These blocks could be on the same surface or different surfaces of cylinder i. Determine, on average, how far around the track must we go to read these k blocks.

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT