A file system with 2 kilobyte blocks can access 32 gigabytes worth of data through an inode’s triple indirect block. How many bits does the file system use for block pointers?
File size = 32GB
32*2^30 bytes
=2^5*2^30
=2^35
Block size is =2KB
=2^11
so we know,
(Block size/Block address)^3 * Block size =Accessable file size
= (2^11/Block address)^3*2^11 = 2^35
= (2^11/Block Address)^3 = 2^24
= (2^11/Block Address) = 2^8
Block Address= 2^11/2^8
=2^3
=8
So, the bits used for block pointer is 8
Note-in formula power of 3 denote the inode triple indirect block
A file system with 2 kilobyte blocks can access 32 gigabytes worth of data through an...
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...
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,...
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...
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 ?
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...
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 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....
Assume an FFS-style file system with an 8 KB block size, 4 byte block numbers, and an inode that contains pointers to the first 10 block numbers, one indirect block, and one double indirect block. Remember that 1 KB = 1024 B, 1 MB = 1024 KB, and 1 GB = 1024 MB. How large in KB can a file be without needing to use the indirect block? How many block numbers can be stored in a single indirect block?...
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
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?