Suppose that you have a UNIX file system where the disk block size is 4096 bytes. Disk addresses and file block pointerstake 32 bits (4 bytes), and the i-node contains 12 direct pointers, one single-indirect pointer and one double-indirectpointer. Assume an index block is the same size as a data block (both 4096 Bytes). If there is a file having 50,000 bytes ofdata and it is never been accessed, we only assume the file's i-node is in memory, but none of the rest of the file. If the userprocess wants to access to read the entire file into the memory, how many I/O operations would be needed?Oa. 15O b. 12O c. 14O d. 13

Dear Student, The answer to your question is given below -

Suppose that you have a UNIX file system where the disk block size i take 32 bits (4 bytes), and the i-node contains 12 direct pointers, one pointer. Assume an index block is the same size as a data block (both data and it is never been accessed, we only assume the file's i-node i process wants to access to read the entire file into the memory, how

Suppose that you have a UNIX file system where the disk block size i take 32 bits (4 bytes), and the i-node contains 12 direct pointers, one pointer. Assume an index block is the same size as a data block (both data and it is never been accessed, we only assume the file's i-node i process wants to access to read the entire file into the memory, how

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

Compilers and Assemblers translate each source file individually to generate object code files. Hence the object files need to be linked together before they can be executed. Theoretically, however, it is possible to skip the linking step and directly have compilers generate the final executable file. What would be the down side of taking the latter approach?
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?
Find the attached file.
Consider a system where free space is kept in a free-space list. a. Suppose that the pointer to the free-space list is lost. Can the system reconstruct the free-space list? Explain your answer. b. Consider a file system similar to the one used by UNIX with indexed allocation. How many disk 1/0 operations might be required to read the contents of a small local file at /a/b/c? Assume that none of the disk blocks is currently being cached. c. Suggest a scheme to ensure that the pointer is never lost as a result of memory failure.
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 al ready in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer these 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 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
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.
Compilers and assemblers create object code files from source files. To run the object files, they must first be linked together. Theoretically, compilers may build final executable files without linking. What are the drawbacks of the latter approach?
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 al ready in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer these 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 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
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
Consider a file system such as the one on your favorite operating system.a. What are the steps involved in the creation and deletion of files and inwriting data to a file?b. Explain how the issues of atomicity and durability are relevant to thecreation and deletion of files and to writing data to files.
Assuming 4K clustering for a 500-byte file, what is the size (in bytes) of the File Slack? O 12 bytes O 1536 bytes O 3584 bytes O 4096 bytes
2. Assume a hypothetical system where disk space has been divided into disk blocks of 25 bytes. The operating system needs to allocate space for a 120-byte file called output log. Create a diagram for each of the three allocation methods showing how the space might be allocated and what information would be stored in the file directory for that file. For Linked Allocation, assume the first 5 bytes of each block is used for the pointer.