Do not copy the solution from other websites , they are wrong . Solve only if you can . Let us consider a file system which uses inodes to manage files on disk where each inode consists of a file name of four bytes, userid of two bytes, three timestamps of four bytes each, protection bits of two bytes, a reference count of two bytes, a file type of two bytes, and the file size of four bytes. In addition tothat, the inode contains 13 direct indices, 1 index to a single indirect block, 1 index to a double indirect block, and one index to a triple indirect block. Each of these indices is 4 bytes.The file system also stores the first 356 bytes of each file in the inode. A disk sector is assumed to be 512 bytes and that each indirect block fills a single sector. What is the maximumfile size for this file system?

According to question bytes to be divided like:

Let us consider a file system which uses inodes to manage files on disk where each inode consists of a file name of four bytes, user d of two bytes, three timestamps of four bytes each, protection bits of two bytes, a reference count of two bytes, a file type of two bytes, and the file size of four bytes. In addition to hat, the inode contains 13 direct indices, 1 index to a single indirect block, 1 index to a double indirect block, and one index to a triple indirect block. Each of these indices is 4 bytes. The file system also stores the first 356 bytes of each file in the inode. A disk sector is assumed to be 512 bytes and that each indirect block fills a single sector. What is the maximum ile size for this file system?

Let us consider a file system which uses inodes to manage files on disk where each inode consists of a file name of four bytes, user d of two bytes, three timestamps of four bytes each, protection bits of two bytes, a reference count of two bytes, a file type of two bytes, and the file size of four bytes. In addition to hat, the inode contains 13 direct indices, 1 index to a single indirect block, 1 index to a double indirect block, and one index to a triple indirect block. Each of these indices is 4 bytes. The file system also stores the first 356 bytes of each file in the inode. A disk sector is assumed to be 512 bytes and that each indirect block fills a single sector. What is the maximum ile size for this file system?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

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 the following question: 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?
A computer uses virtual memory, and a new solid-state drive (SSD) as space for paging. Refer to the last ppt file. In the case presented there, the hard disk drive (HDD) required 25 ms to read in a page, and a rate of 1 page fault per 1000 references introduced a 250 slowdown. If the SSD offers a time of only 80 µs, what is the slowdown in performance caused by 1 pf per 1000 references (you are not concerned with dirty vs. clean pages). What is the maximum rate of page faults you can accept if you want no more than a 5% slowdown in execution using virtual memory? Know your metric prefixes and symbols for time: s for seconds, ms for milliseconds, µs for microseconds, ns for nanoseconds.
UNIX treats file directories in the same fashion as files; that is, both are defined by the same type of data structure, called an inode. As with files, directories include a nine-bit protection strong. If care is not taken, this can create access control problems. For example, consider a file with protection mode 644(octal) contained in a directory with protection mode 730. How might the file be compromised in this case? What can we do to stop this vulnerability without changing the protection mode 730 for the directory?
For this assignment, write a pair of programs, in C or as shell scripts, to send and receive a message. Your programs will: Send and receive a message by a covert channel on a MINIX 3 system. Hint: A permission bit can be seen even when a file is otherwise inaccessible, and the sleep command or system call is guaranteed to delay for a fixed time, set by its argument. Measure the data rate on an idle system. Create an artificially heavy load by starting up numerous different background processes and measure the data rate again.
Suppose a disk has N cylinders, numbered from 0 to P. At some time, the disk arm is at cylinder X, and there is a queue of disk access requests for cylinders R1, R2, R3, R4. Explain which Disk scheduling algorithm should be the best to be used between the following a) FIFO b) CSCAN c) SSTF d) FSCAN e) CLOOK N: B • • Choose any acceptable numeric numbers for N, P, X, R1, R2, R3 and R4 • • Plagiarism Will be penalized heavily
Task: 1. Write a C program to simulate the sequential file allocation in a very simple file system. 2. Assume a disk of 32 blocks, each block is of 1 KB size 3. First 8 blocks (0 to 7) are allocated to the “iNodes” and can’t be used by the file system. Hence blocks available for allocation are from block 8 to block 31. 4. Minimum file size is 1 KB. Hence the file system can have minimum of one file of size 24 KB or maximum of 24 files. 5. At the start, it is assumed that the file system has no files. 6. The program shall ask the user to input the number of files to allocate and their respective names and file sizes. 7. The program shall randomly (set a seed with srand(seed) to replicate the randomness) select any free block as a start block. Check that the start block and the required contiguous blocks are free. If free, allocate those blocks to the file. If not free, find next available contiguous blocks. 8. After allocating blocks for all the files, the program shall print file name,…
Consider a disk with a sector size of 512 bytes, 1,000 tracks per plater, 100 sectors per track, 10 tracks per cylinder and a block size of 2,048 bytes including 48 bytes for non-data overhead. Suppose that a file containing 1,000,000 records of 100 bytes each is to be stored on such a disk and that no record can span two blocks. a) How many records fit onto a block? b) How many cylinders are required to store the entire file?
Consider a file system that uses contiguous allocation method. For a disk consists of 100 data blocks, each block is 4KB. What is the maximum and minimum number of files of size 15KB can it save? Find the number of files the disk able to support using (1) link allocation and (2) index allocation, assuming the address is 32 bit.
For Heap File with a page directory, assume that a page can contain up to 100 directory entries and a page can contain 1000 records, for a file of 1,000,000 records, what is the number of pages to store these records, assuming that on average data pages are filled up 70%? With this data page utilization, what is the number of pages to store the directory, assuming that each directory page is full? Assuming both the directory and the file are stored on disk, what is the I/O cost to insert one record in worst case, and in the average case?
Suppose that there is a file system with blocks of 512 bytes in size. For each inode, there are 20 direct blocks, 2 singly-indirect blocks, and 2 doubly-indirect blocks. The size of a pointer is 4 bytes. Calculate the maximum possible size of a file in bytes. Show your work.
Suppose a file system is based on the indexed allocation strategy for managingblocks. Assume each file has a directory entry giving the file name, first index block,and the length of the file. The first index block points in turn to 128 file blocks andto the next index block. Suppose that each file block contains 4KB of data and theuser is currently reading the 441K-th byte of a file. If the user’s next operation is toread the 1201k-th byte of the same file, how many physical disk I/O operations mustbe performed in order to read that byte? Explain your answer in detail usingdiagrams as appropriate.
A disk has a capacity of two tera-byte size. Say the file system uses a multi-level inode structure for locating the data blocks of afile.The inode stores pointers to data blocks, including a single indirect block, a double indirect block, and several direct blocks in the 64 B of available space.Now, it is given that the disk has a block size of 512 B. The maximum file size that can be stored in such a file system in MB (round off upto 2 decimal places).