ppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 133, and the previous request was at cylinder 115. The queue of pending requests, in FIFO order, is:76,1460, 903, 1764, 938, 1499, 1012,1740,120. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? (a) FCFS (b).SSTF (c) SCAN (d) LOOK (e) C-SCAN (f) C-LOOK

ppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 133, and the previous request was at cylinder 115. The queue of pending requests, in FIFO order, is:76,1460, 903, 1764, 938, 1499, 1012,1740,120. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? (a) FCFS (b).SSTF (c) SCAN (d) LOOK (e) C-SCAN (f) C-LOOK

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter8: Advanced Data Handling Concepts

Section: Chapter Questions

Problem 20RQ

See similar textbooks

Similar questions

Suppose that a disk drive has 7,000 cylinders, numbered 0 to 6,999. The drive is currently serving a request at cylinder 1,958, and the previous request was at cylinder 1,807. The queue of pending requests, in FIFO order, is: 2,069, 1,212, 2,296, 2,800, 544, 1,618, 356, 1,523, 4,965, 3681 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests with First Come First Serverd(FCFS) alogrithim?
Suppose that a disk drive has 6,000 cylinders, numbered 0 to 5999. The drive is currently serving a request at cylinder 2225, and the previous request was at cylinder 5195 (Hint: this indicates the reading head’s moving direction). The queue of pending requests, in FIFO order, is: 5962,2876,5452,1369,3594,5046,866,3269,409,1744 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? a. FCFS SSTF SCAN LOOK C-SCAN C-LOOK
Given the following sequence of arrivals and called to the counter, what will be the content of the following queue: 1. Alia 2. Shaari 3. Alwee 4. Marion 5. Call from counter 6. Aliffa 7. Call from counter 8. Call from counter 9. Shukri 10. Leon Select one: a.Marion, Aliffa, Shukri, Leon b.Alia, Shaari, Alwee, Marion c.Alia, Shaari, Shukri, Leon d.Alia, Shaari, Alwee, Marion, Aliffa, Shukri, Leon
Consider a telephone system for ordering Cleveland Guardians(the new name for the MLB team) tickets when they go on sale for a new season. If a customer call to generate 12 enqueue requests for tickets every 5 seconds, and the staff can process (and therefore dequeue) 15 requests every 6 minutes, how big will the queue need to be to hold all pending requests after 5 hours of operation of the phone system.
Suppose, there are three producers P1, P2, and P3 who want to produce and put items in the buffer. And, there are four consumers C1, C2, C3, and C4 who want to consume items from the buffer. No process takes more than 5 units of time to complete unless the process goes to the waiting queue(S->list) of semaphore. At a certain point of the execution, following are the values of the semaphores: mutex=1 , countEmpty=8, countFull=2 Find the output of the following sequence of commands. At time 0 : C1 started At time 0: C2 started At time 10: C3 started Value of countEmpty ? Value of countFull ? Processes in the waiting queue of the semaphore ? [Write process names with Capital letter, For example: P7. If there are multiple process writes their names using comma, For example: P6,P7. If there is no process in the semaphore's list, write EMPTY in the box] At time 15 : P1 started At time 20 : P2 started Value of countEmpty ? Value of countFull ? Processes in the waiting queue of the…
Consider a state space where the start state is number 1 and each state k has two successors: numbers 2k and 2k + 1. Draw the portion of the state space for states 1 to 15. Suppose the goal state is 11. List the order in which nodes will be visited for iterative deepening search.
Give the state of the priority queue after SS is visited in the format shown above fringe: Give the state of the priority queue after B is visited fringe:
Problem Suppose, there are three producers P1, P2, and P3 who want to produce and put items in the buffer. And, there are four consumers C1, C2, C3, and C4 who want to consume items from the buffer. No process takes more than 5 units of time to complete unless the process goes to the waiting queue(S->list) of semaphore. At a certain point of the execution, following are the values of the semaphores: mutex=1 , countEmpty=8, countFull=2 Find the output of the following sequence of commands. At time 0 : C1 started At time 0: C2 started At time 10: C3 started Value of countEmpty: ANSWER: Value of countFull: ANSWER: Processes in the waiting queue of the semaphore: [Write process names with Capital letter, For example: P7. If there are multiple process writes their names using comma, For example: P6,P7. If there is no process in the semaphore's list, write EMPTY in the box] ANSWER: At time 15 : P1 started At time 20 : P2 started Value of countEmpty: ANSWER: Value of countFull: ANSWER:…
Given an n-ary tree of resources arranged hierarchically such that height of tree is O(Log N) where N is total number of nodes (or resources). A process needs to lock a resource node in order to use it. But a node cannot be locked if any of its descendant or ancestor is locked. Following operations are required for a given resource node:Lock()- locks the given node if possible and updates lock information. Lock is possible only if ancestors and descendants of current node are not locked.unLock()- unlocks the node and updates information.How design resource nodes and implement above operations such that following time complexities are achieved.Lock() O(log N)unLock() O(log N)Part b : -Let's say you are running the lock/unlock in a multi core machine. Now you want to let multiple threads to run lock() simultaneously.As we saw in part A, locking a node has multiple validations inside. Will doing lock on two nodes cause a race condition.If yes, how will you solve it.In short, how do make…
Suppose Dr. WhyLie comes up to you and claims that he has invented a super-fastcomparison based priority queue. The speed of the priority queue operations are as follows(n is the number of items currently in the priority queue):a. insert a new item in O(sqrt(log n)) timeb. extract (remove and return) the smallest item from the priority queue in O(sqrt(logn)) time.Explain why Dr. WhyLie must be lying.
Consider the current elements and its indexes in the queue of size 15: {index[00]=102, index[01]=165, index[02]=115, index[03]=384, index[04]=248, index[05]=111}, draw a table (like shown below) the sequence of elements using the operations listed from number 1 to 26 using the queue approach (A) - in shifting the elements one position forward every time an element is deleted. The following are the description of other operations to be used that would result in a QUEUE that contains the elements. IsTopValue – returns the value at the TOP of the queue. IsRearValue – returns the value at the REAR of the queue. IsTopIndex – returns the index of the value at the TOP of the queue. IsRearIndex – returns the index of the value at the REAR of the queue. IsIndexOf – returns the index of the specific value. IsValueOf – returns the value of the specific index. Insert (Q, 12) Dequeue (Q) Dequeue (Q) Insert (Q, 65) Insert (Q, 100) Insert (Q, 43) Dequeue (Q) IsTopValue (Q) Insert (Q, 61) Dequeue…
The leaf nodes of a B+-tree file organization may lose sequentiality after a sequence of inserts. The leaf nodes of a B+-tree file organization may lose sequentiality after a sequence of inserts. To minimize the number of seeks in a sequential scan, many databasesallocate leaf pages in extents of n blocks, for some reasonably large n.When the first leaf of a B+-tree is allocated, only one block of an n-blockunit is used, and the remaining pages are free. If a page splits, and itsn-block unit has a free page, that space is used for the new page. If then-block unit is full, another n-block unit is allocated, and the first n∕2 leafpages are placed in one n-block unit and the remaining one in the secondn-block unit. For simplicity, assume that there are no delete operations. The technique of redistributing values to siblings to improve space utilization is likely to be more efficient when used with the preceding allocation scheme for leaf blocks. Explain why.