Question

Q1) A particular implementation of UNIX operating system provides the file structure modelled in the Figure 1. Here the i-node for the file contains certain information such as the access permissions for the file. This is followed by the entries that contain information about where the file is located on the storage device. The first 10 entries are the addresses of blocks where actual data for the file are stored. If block can contain 512 bytes of information, then these 10 direct blocks can hold up to 512 x 10-5120 bytes of data When the size of the file exceeds 10 blocks, the eleventh entry provides access to, or points to, an indirect block. This indirect block contains the addresses for 128 additional blocks where data can be stored. If this indirect block is used, the size of the file can be as large as 10+128 138 blocks, and it can contain up to 512 x 13870, 656 bytes of Various Blocks 128 Indirect block information 10 Blocks a) A twelfth entry is needed if more than 138 blocks are required for the file. This entry contains the address df double indirect block that in turn contains the addresses of 128 indirect blocks. As noted earlier, each of these indirect blocks contains the address for 128 blocks where data can be stored. If a file uses 12 entries in its i-node, what is its 12 13 128 128 128 128 block blocks maximum size (in bytes)? 128 b) When the file must be even larger than that provided by 12 entries, a thirteenth entry is needed. It provides the address to a triple indirect block that points to 128 double indirect blocks (as shown in Figure 1). Determine the maximum file size, for implementation of this UNIX operating 128 128 Triple 128 128 system under these conditions, (in bytes) 128 Figure 1 Answer Q1)

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

A.

If the 12th block is used, size of the file can be = 10 + 128+ 128*128

=16,522

Max size it can store = 512*16522

= 8,459,264 bytes

B.

If the 13th block is used, size of the file can be = 10 + 128 + 128*128 + 128*128*128

= 2,113,674

Max size it can store = 512*2113674

=1,082,201,088 bytes

Add a comment
Know the answer?
Add Answer to:
Q1) A particular implementation of UNIX operating system provides the file structure modelled in the Figure...
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
  • 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....

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

  • Operating System: In a combined UNIX UFS file system, with single, double and triple indirect poi...

    Operating System: In a combined UNIX UFS file system, with single, double and triple indirect pointers, answer the following: a) what is the maximum possible size of a file? Assume that a pointer takes 4 bytes and that blocks are 128 bytes long. b) In a file of maximum size, what is the ratio of storage in bytes consumed by all the pointers and pointer blocks to the maximum file size in bytes? Operating System: In a combined UNIX UFS...

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

  • a drive has 512 sectors per track a block size of 512 bytes and spins at...

    a drive has 512 sectors per track a block size of 512 bytes and spins at 12000 rpm. (a)what is the max file size in terms of blocks for a unix file system with 1024 byte blocks and 32 bit bloack addresses if every i-node has 10 direct block addresses, 1 indirect block address, 1 double indirect block address and 1 triple indirect block address. (B) consider the prefix code : b: 1111 a:1110 i:1101 j:1100 s:101 t:100 1:01 3:00...

  • STORAGE AND FILE SYSTEM • Example 9-A 32-bit Berkeley UNIX file system has a block size...

    STORAGE AND FILE SYSTEM • Example 9-A 32-bit Berkeley UNIX file system has a block size of 8 kilobytes. How many blocks of a given file can be accessed: • (a) Using the block addresses stored in the i-node? blocks • (b) With one level of indirection? blocks _blocks • (c) With two levels of indirection?

  • Computer Science Operation System question. I will give thumb up, thank you! Consider a file system that uses inodes to represent files. This file system has 16 direct disk blocks, as well as single,...

    Computer Science Operation System question. I will give thumb up, thank you! Consider a file system that uses inodes to represent files. This file system has 16 direct disk blocks, as well as single, double, and triple indirect disk blocks. This file system is illustrated in the below figure. Please notice that the tables pointed to by the indirect pointers are full sized blocks that only stores pointers. mode owners (2) timestamps (3) size block count data data data direct...

  • Consider a file system that uses inodes to represent files. To locate the physical blocks of...

    Consider a file system that uses inodes to represent files. To locate the physical blocks of each file, its inode contains up to 12 direct disk blocks, as well as one single, one double, and one triple indirect disk blocks. a. If disk blocks are 1 KB in size, and a pointer to a disk block requires 4 bytes. What is the maximum size of a file that can be stored in this file system? Note the size of a...

  • What is the maximum file size supported by a file system with 16 direct blocks, a...

    What is the maximum file size supported by a file system with 16 direct blocks, a single, a double, and a triple indirection blocks? The block size is 1KB. Disk block numbers can be stored in 4 bytes.

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

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