Question

Consider a file system similar to the one used by UNIX (indexed allocation). How many disk operations are required to access the contents of a file at /dir1/dir2/fle3 ? Assume that none of the disk blocks is currently being cached Total number of disk operations:

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

There will be a total of 4 disk operations required to access the file.

Explanation:

First the the root directory disk block will be read,

Then, two operations will be required for reading the disk block having the directories dir2 and file3 and finally reading the disk block that contains the file.

Add a comment
Know the answer?
Add Answer to:
Consider a file system similar to the one used by UNIX (indexed allocation). How many disk...
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
  • Consider a file system similar to the one used by UNIX (indexed allocation). How many disk operat...

    Consider a file system similar to the one used by UNIX (indexed allocation). How many disk operations are required to access the contents of a file at dir1/dir2/file3 ? Assume that none of the disk blocks is currently being cached. Total number of disk operations:

  • 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...

  • 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?

  • 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,...

  • 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

  • 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...

  • A UNIX-type file-system uses a disk block size of 1KB, 128 byte inodes, and 32 bit...

    A UNIX-type file-system uses a disk block size of 1KB, 128 byte inodes, and 32 bit disk addresses. If the inode contains 64 bytes of data, 8 direct, 1 indirect, 1 double-indirect, and 1 triple- indirect blocks, apart from other file information. How many disk blocks would be required for storing files of sizes (a) 1 byte (b) 1024 bytes (c) 64 KB (d) 1MB ?

  • Part B Consider a file system that uses a structure similar to an i-node with the...

    Part B Consider a file system that uses a structure similar to an i-node with the following differences. If the file size is less than 100 bytes, the data is stored directly in the i-node. If it is larger, there are 8 direct links (point to a data block), 2 single-indirect links, 1-double indirect links and 1 triple indirect link. What is the largest file size that can be indexed in this system? Assume the block size is 1024 bytes....

  • 11. Consider a file system that uses a structure similar to an i-node with the following...

    11. Consider a file system that uses a structure similar to an i-node with the following differences. If the file size is less than 100 bytes, the data is stored directly in the i-node. If it is larger, there are 6 direct links (point to a data block), 1 single-indirect links, 2-double indirect links and 1 triple indirect link. (a) What is the largest file size that can be indexed in this system? Assume the block size is 512 bytes....

  • 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

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
ADVERTISEMENT