Answer please Suppose the following disk request sequence(track numbers) for a disk with 200 tracks ( 0 to199 ) is given: 98, 183, 37, 122, 14, 124, 65, 67.Assume that the initial position of the R/W headis on track 53. The additional distance that willbe traversed by the R/W head when the FirstCome First Serve (FCFS) (SSTF) algorithm isused compared to the Shortest Seek Time Firstalgorithm istracks.

Answered: Image /qna-images/answer/3ce8e807-e1c6-480d-8963-d580cb492d17.jpg

Answered: 14, 124 n of the listance when the -)…

Engineering

Computer Science

14, 124 n of the listance when the -) algori I Seek T

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

A SONET STS-1 SPE is mapped into an STS-1 line. An STS-1 SPE frame consists of 87 columns of 9 bytes, or altogether 783 bytes. There are always 8,000 frames per second. The SPE clock is slower than the line clock by a factor of 5 x 10-7 .On average, we expect to find one pointer adjustment for how many SONET frames?
Consider the process track request are 98, 183, 37, 122, 14, 124, 14, 124, 65, 67 and the initial seek is 53. What is the total number of seeks for the C-Look algorithm?
Consider the following disk request sequence for a disk with 100 tracks 54, 25, 76, 85, 10, 50, 77, 43, 61, 21. Head pointer starting at 30 and moving in left direction. 1) Find the number of head movements in cylinders using C-Scan scheduling. 2) Find the number of head movements in cylinders using C-Look scheduling.
Logic XOR operation of (11101010)2 & (10101010)2 has a result of"? Explain your answer. A page fault means that we referenced a page A. Outside the memory boundaries B. With an incorrect I/O request C. That was not in secondary storage D. That was not in main memory Justify your answer with explanations
Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing these requests is
A disk has a capacity of two tera-byte size. Say the file system uses a multi-level inode structure for locating the data blocks of afile.The inode stores pointers to data blocks, including a single indirect block, a double indirect block, and several direct blocks in the 64 B of available space.Now, it is given that the disk has a block size of 512 B. The maximum file size that can be stored in such a file system in MB (round off upto 2 decimal places).
Consider a paging system with the page table stored in memory.a. If a memory reference takes 400 nanoseconds, how long does a paged memoryreference take?b. If we add TLBs, and 95 percent of all page-table references are found in the TLBs,what is the effective memory reference time? (Assume that finding a page-table entry inthe TLBs takes zero time, if the entry is there.)
In a main memory-disk virtual storage system, the page size is 1KByte and the OPTIMAL algorithm is used for page replacements. A given program has been allocated three page frames in the main memory and it makes the following 16 memory references when it starts executing (the addresses are given in decimal):500, 2000, 2500, 800, 4000, 1000, 5500, 1500, 2800, 400, 5000, 700, 2100, 3500, 900, 2400 Fill in the contents of the three page frames after each memory reference in a table and calculate the hit ratio. Hint: denote by 'a' the page consisting of locations 0 through 1023 in memory. Similarly, b: 1024-2047, c: 2048-3071, d: 3072-4095, e: 4096-5119 and f: 5120-6143. Round to three decimal places.
Consider a magnetic disk with 1000 cylinders rotating at a speed of 7200 revolutions per minute. The sector size on the disk is 1024 bytes. Assume that requests for sectors arriving from the file system can be located anywhere on the disk with equal probability and the locations of the requested sectors are independent of each other. Under these assumptions, the average seek time is 7 milliseconds. The transfer time per sector is 0.01 milliseconds (i.e., the raw data rate is 100 Megabytes per second). What is the effective data rate (select the answer closest to your calculated throughput)? a, 90KBytes/sec b. 100KBytes/sec c. 90MBytes/sec d. 100MBytes/sec
Consider a disk pack with 32 surfaces, 64 tracks and 512 sectors per pack. 256 bytes of data are stored in a bit serial manner in a sector. The number of bits required to specify a particular sector in the disk is.
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,212 2,296 2,800 544 1,618 356 1,523 4,956 3,681 Calculate the total seek time for each of the schedules TOTAL DISTANCE TOTAL SEEK TIME FCFS SSTF SCAN LOOK C-SCAN C-LOOK
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 (both 4096 Bytes). If there is a file having 50,000 bytes of data 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 user process wants to access to read the entire file into the memory, how many I/O operations would be needed? O a. 15 O b. 12 O c. 14 O d. 13