Suppose that you have a very simple file system (VSFS) using i-node to manage disk data blocks, where the disk block size is 4096 bytes. Disk addresses and file block pointers take 32 bits (4 bytes), and the i-node contains 10 direct pointers, one single-indirect pointer and one double-indirect pointer. Assume an index block is the same size as a data block (both 4096 Bytes). If there is a file having 45,000 bytes of data and it has never been accessed, we only assume the file's i-node is in memory, but none of the rest of the file. If the user process wants to read the entire file into the memory, how many disk blocks (including both data blocks and index block(s)) would be brought into the main memory? O a. 11 O b. 10 O C. 12 O d. 1035 O e. 1034

Suppose that you have a very simple file system (VSFS) using i-node to manage disk data blocks, where the disk block size is 4096 bytes. Disk addresses and file block pointers take 32 bits (4 bytes), and the i-node contains 10 direct pointers, one single-indirect pointer and one double-indirect pointer. Assume an index block is the same size as a data block (both 4096 Bytes). If there is a file having 45,000 bytes of data and it has never been accessed, we only assume the file's i-node is in memory, but none of the rest of the file. If the user process wants to read the entire file into the memory, how many disk blocks (including both data blocks and index block(s)) would be brought into the main memory? O a. 11 O b. 10 O C. 12 O d. 1035 O e. 1034

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

Write a C program Producer – Consumer as a classical problem of synchronizationStep 2. Write a program* that solves the producer - consumer problem. You may use the following pseudo code for implementation.*program to write: produce -consumer problem to produce and consume the alphabet.//Shared data: semaphore full, empty, mutex;//pool of n buffers, each can hold one item//mutex provides mutual exclusion to the buffer pool//empty and full count the number of empty and full buffers//Initially: full = 0, empty = n, mutex = 1//Producer thread do {…produce next item…wait(empty); wait(mutex);…add the item to buffer…signal(mutex); signal(full);} while (1);//Consumer thread do {wait(full) wait(mutex);…remove next item from buffer…signal(mutex); signal(empty);…consume the item } while (1);
1. Create a Python programme that uses the multiprocessing method and the Pool object to spawn 10 processes with inputs 1,...,10, and each process calculates and returns the sum of integers up to and including its input.2. Write a Python programme that multiplies matrices to n n using columnwise 1D partitioning. 1. Create a Python programme that uses the multiprocessing method and the Pool object to spawn 10 processes with inputs 1,...,10, and each process calculates and returns the sum of integers up to and including its input.2. Write a Python programme that multiplies matrices to n n using columnwise 1D partitioning.
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. Could you hand draw the page table, if possible a) Suppose that the OS uses a two-level page table. Draw the page table. (Assume that frames 7 through 221 are free, so you can allocate space for the page table there.) In addition, suppose that the page-table directory storage comprises a whole number of consecutive full frames. (For examples: if the directory entry is 2 bytes, the entry’s storage comprises 1 frame; if the directory entry is 260 bytes, the entry’s storage comprises 2 consecutive frames.) b) What is the size of the two-level page table
Consider a distributed file system that uses per-user name spaces. In other words, each user has his own, private name space. Can names from such name spaces be used to share resources between two different users?
Student information is stored in a data area, and each student entry is formatted as follows:The first nine bytes are the student ID in ASCII format.The following byte is the course score.The following phrase is the section identifier. There are over 300 such student records in memory, which have been loaded consecutively beginning at address $10000. To indicate the conclusion of the records, the last record loaded is a dummy record with a section identifier of $FFFF. Create an assembler subroutine GetMax that searches the complete list for the highest mark. If there is a tie, the student with the highest score on the list should be found. The beginning address of the subroutine should be returned.
Suppose that a block is 1K Byte and that a disk address is 4 bytes. Suppose that files are implemented using i-nodes, and that an i-node has the following structure: the last address in the inode is a third-level indirect block; the second-to-last address is a second-level indirect block; the third-to-last address is an indirect block; and the remaining addresses are data blocks. Approximately how large a file can this system support?
A file system with 300 GByte uses a file descriptor with 8 direct block address. 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. Find the maximum possible file size in this file system.
. Q: In this problem you are to compare reading a file using a single-threaded file server and a multithreaded server. It takes 15 msec to get a request for work, dispatch it, and do the rest of the necessary processing, assuming that the data needed are in a cache in main memory. If a disk operation is needed, as is the case one-third of the time, an additional 75 msec is required, during which time the thread sleeps. How many requests/sec can the server handle if it is single threaded? If it is multithreaded?
. Q: In this problem you are to compare reading a file using a single-threaded file server and a multithreaded server. It takes 15 msec to get a request for work, dispatch it, and do the rest of the necessary processing, assuming that the data needed are in a cache in main memory. If a disk operation is needed, as is the case one-third of the time, an additional 75 msec is required, during which time the thread sleeps. How many requests/sec can the server handle if it is single threaded? If it is multithreaded?
1. Suppose you have designed a Register File. Let say this file contains 64 registers, and each register can store 18-bit data. Then, you have designed an n bit ALU with 4 operations. From the information given above, what will be the value of RS RT RD and n Why?