2p Question 37 Select the correct answer regarding "Linked Allocation" of disk blocks to files. O File Allocation Table (FAT) is located on the disk volume and it is similar to the index block of Unix file system. O Each block should contain a pointer to the next block as part of its data which causes multiple I/O operations to access the desired information in the file. O The disk blocks must not be cor iguous to allow them to be linked. O Linked Allocation suffers from both external fragmentation and internal fragmentation. Next << Previous No new data to save. Last checked at 3:44pm Subm

2p Question 37 Select the correct answer regarding "Linked Allocation" of disk blocks to files. O File Allocation Table (FAT) is located on the disk volume and it is similar to the index block of Unix file system. O Each block should contain a pointer to the next block as part of its data which causes multiple I/O operations to access the desired information in the file. O The disk blocks must not be cor iguous to allow them to be linked. O Linked Allocation suffers from both external fragmentation and internal fragmentation. Next << Previous No new data to save. Last checked at 3:44pm Subm

Database Systems: Design, Implementation, & Management

12th Edition

ISBN:9781305627482

Author:Carlos Coronel, Steven Morris

Publisher:Carlos Coronel, Steven Morris

Chapter1: Database Systems

Section: Chapter Questions

Problem 10P

See similar textbooks

Similar questions

18.10 Briefly explain the concept of linked allocation, noncontiguous file storage. For a file that is stored in blocks 5, 12, 13, 14, 19, 77, and 90, show what a linked allocation might look like.
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?
Consider a file currently consisting of 100 blocks. Assume that the file control block (and the index block, in the case of indexed allocation) is already in memory. Calculate how many disk I/O operations are required for contiguous, linked, and indexed (single-level) allocationstrategies, if, for one block, the following conditions hold. In the contiguous-allocation case, assume that there is no room to grow at the beginning but there is room to grow at the end. Also assume thatthe block information to be added is stored in memory.a. The block is added at the beginning.b. The block is added in the middle.c. The block is added at the end.d. The block is removed from the beginning.e. The block is removed from the middle.f. The block is removed from the end
Consider a file currently consisting of 90 blocks. Assume that the file control block (and the index block, in the case of indexed allocation) is already in memory. Calculate how many disk I/O operations are required for contiguous, linked, and indexed (single-level) allocation strategies, if, for one block, the following conditions hold. In the contiguous-allocation case, assume that there is no room to grow at the beginning but there is room to grow at the end. Also assume that the block information to be added is stored in memory.) i) The block is added at the beginning. ii) The block is added in the middle. iii) The block is added at the end. iv) The block is removed from the beginning. v) The block is removed from the middle. vi) The block is removed from the end
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?
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
1. Assume that a virtual memory is managed using a buffer pool. The buffer pool contains five buffers and each buffer stores one block of data. Memory accesses are by disk block ID. Assume the following series of memory accesses takes place. 5 2 5 12 3 6 5 9 3 2 4 1 5 9 8 15 3 7 2 5 9 10 4 6 8 5 2. For the following buffer pool, using the LRU replacement heuristic, show the disk block ID of the buffer pool as each disk block is called using the table below. Assume that the buffer pool is initially empty.
Implementation of a Disk-based Buffer Pool A buffer pool is an area of main memory that has been allocated for the purpose of caching datablocks as they are read from disk. The main purpose of a buffer pool is to minimize disk I/O.Tasks: Implement a disk-based buffer pool application based on the below three buffer poolreplacement schemes: FIFO (first in, first out), LRU (least recently used), and LFU (Leastfrequently used) buffer pool replacement strategies.FIFO (First In, First Out): the oldest data block in the buffer pool is replaced.LRU (Least Recently Used): the least recently accessed data block in the buffer pool is replaced.LFU (Least Frequently Used): the least frequently accessed data block in the buffer pool isreplaced.Initially, the buffer pool is free. Disk blocks are numbered consecutively from the beginning ofthe file with the first block numbered as 0. When I execute your program,First, it asks the user to input the following parameters:o ?: number of blocks in the…
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.
6. Let a file requires 4 blocks to store it. The free space management system provides the following free blocks for the file: 234, 653, 12, 4. Draw a figure that describes how these four blocks can be linked in the FAT based file system.
Consider a file F whose data is spread over 1000 physical disk blocks on the disk. Assume the size of a logical block is equal the size of a physical block. Given a logical block number X, what is the maximum number of disk accesses that you would need to retrieve the physical block that corresponds to X? Assume the file control block of F and the directory entry that contains information about F are cached in the main memory.
Discuss the various file allocation methods used in file systems, such as contiguous allocation, linked allocation, and indexed allocation, highlighting their pros and cons.

SEE MORE QUESTIONS

Recommended textbooks for you

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781305627482

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781285196145

Author:

Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Publisher:

Cengage Learning

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781305627482

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781285196145

Author:

Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS