Suppose that you have a UNIX file system where the disk block size is 4096 bytes. Disk addresses and file block pointers take 32 bits (4 bytes), and the i-node contains 12 direct pointers, one single-indirect pointer and one double-indirect pointer. Assume an index block is the same size as a data block, then the maximum number of data blocks a file will support by this i-node is

Suppose that you have a UNIX file system where the disk block size is 4096 bytes. Disk addresses and file block pointers take 32 bits (4 bytes), and the i-node contains 12 direct pointers, one single-indirect pointer and one double-indirect pointer. Assume an index block is the same size as a data block, then the maximum number of data blocks a file will support by this i-node is

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 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.
Consider a file system that uses indexed allocation with a maximum of one index node per file. Suppose the index node occupies 4096 bytes, that each block pointer occupies 4 bytes. Ignore the metadata associated with the file that is usually contained in the index node. How large should a block be (in bytes) so that this scheme is able to completely access files on a 1 GB file system?
Consider a file system that uses indexed file allocation. Disk block size is 1K-byte, and a file pointer is 64 bits (8-bytes). If we assume that an i-node just holds 2 direct entries and 4 single indirect entries, what is the maximum size of a file the system can allow? List the steps that lead to your conclusion.
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.
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is:2,069 1,2122,2962,8005441,6183561,5234,9653681a. FCFSb. SSTFc. SCANd. LOOKe. C-SCANf. C-LOOK
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
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.
One problem with page-mapped FTLs is that they make the mapping tables too large Assume you have a page-mapped FTL. If each entry in the FTL takes 4 bytes (assuming it is an array), how large is the FTL? Assume the SSD is only 1 MB in size, and uses 1 KB pages. a) 1 KBb) 4 KBc) 1 MBd) 4 MBe) None of the above A basic file systems, assume a simple disk model where each disk read of a block takes D time units. Also assume the basic layout is quite like the very simple file system or (vsfs). 1. Assume that all data and metadata begin on disk. Assume further that all inodes are in separate blocks, and that each directory is only one block in size. How long (in term of D time units) does it take to open the file /a/b/c/d.txt? 2. Assume after opening the file, we read the file in its entirety. It is a big file, containing 1036 blocks. The inode itself has room for 12 direct pointers and 1 indirect pointer. Disk addresses are 4 bytes long, and disk blocks are 4KB in size. After opening…
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?
Suppose the head of a moving head disk with 200 tracks numbered 0-199 is currently servinga request at track 143. It has just finished a request at track 125. If the queue of requests iskept in the FIFO order,86,147,85,177,94,150,102,175,130What is the total head movement to satisfy these requests for the following disk schedulingalgorithms? First Come First Served Shortest Seek Time First SCAN
Consider the following code snippet in C: char *base_url = malloc(11 * sizeof(char)); printf("Enter an 11 character URL: "); scanf("%s", base_url); char src[11]; char dst[11]; // copies base_url to src strncpy(src, base_url, 11); // copies src to dest strcpy(dst, src); printf("src: %s dst: %s\n", src, dst); Identify at least one potential buffer overflow vulnerability and explain why/how it can be exploited (i.e., not just that it’s a buffer overflow, but where the problem will manifest itself).
Suppose we have a Unix file system with block size of 8 Kbyte and pointers with size of 4 bytes. How large a file can be represented using only single indirect pointer in inode? A. 8 Kbyte B. 2K * 8 Kbyte C. 2K * 2K * 8 Kbyte D. 2K * 2K * 2K * 8 Kbyte