1. Assume data block can hold 512 Bytes and iNode has 10 direct pointers. 11 th point is a single indirect and 12th pointer is a double indirect. There are 12 pointers altogether. Assume address block can hold 12 addresses. Assume the iNode is already in memory. a) Explain how 512*5 Byte can be accessed? b) Explain how 512*15 Byte can be accessed? c) How big file canbe addresse by this l-node? Show your work.

1. Assume data block can hold 512 Bytes and iNode has 10 direct pointers. 11 th point is a single indirect and 12th pointer is a double indirect. There are 12 pointers altogether. Assume address block can hold 12 addresses. Assume the iNode is already in memory. a) Explain how 5125 Byte can be accessed? b) Explain how 51215 Byte can be accessed? c) How big file canbe addresse by this l-node? Show your work.

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 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
What is the index address location of the multiarray index containing the "X" value? O [1][5] O [5][1] O [2][4] O [4][2] O None of these X
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
Answer all 3 question with explanation.
Exercise: A computer has 4 frames. Page size is 2KB (2048). The loaded time, the R and M bits for each page are shown below Page Frame Loaded time M R 11 1 15 3 13 4 5 5 7 6. 3 3 Question: compute the physical address of the following virtual address a) 1000 using FIFO b) 3100 using NRU c) 3100 using LRU d) 6200 using Second chance Note: consider each case separately
Compare the main memory organization schemes of contiguous-memory allocation, pure segmentation, and pure paging with respect to the following issues: a. External fragmentation b. Internal fragmentation c. ability to share code across processes
Operating system
In mapping, the data can be mapped only in one line in the Cache Memory. Select one: a. Associative O b. Indirect O C. Direct O d. Set Associative
Computer Science You are given a cache that has 16 byte blocks, 512 sets, and is 2-way set associative. Integers are 4 bytes. Give the C code for a loop that has a 100% miss rate in this cache but whose hit rate rises to almost 100% if you double the size of the cache. Do not assume the starting indexes of any arraysarrays.
1. Caches are important to providing a high-performance memory hierarchy to processors. Below is a list of 32-bit memory address references, given as word addresses. 42, 137, 66, 50, 38, 225, 173, 22, 19, 88, 51, 43 a. For each of these references, identify the binary address, the tag, and the index given a direct mapped cache with 16 one-word blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. b. For each of these references, identify the binary address, the tag, and the index given a direct mapped cache with two-word blocks and a total size of 8 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. Please explain the process.
Which fields inside an entry in a log file will be made available to be processed by the log processing function that has been specified? The following piece of code causes an average of how many cache misses per entry, assuming that cache blocks are 64 bytes in size and that no prefetching is performed.
Q1:.