Answered: Suppose that a disk drive has 200… | bartleby

Programming Logic & Design Comprehensive

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

Related questions

Question

S Edit & Create v
e Share
1..
Suppose that a disk drive has 200 cylinders num-
bered 0 to 199. The drive is currently serving a
request at cylinder 95, the queue of pending
requests, in FIFO order is 98, 181, 37, 120, 14,
122, 65, 69.
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 al-
gorithm,
(1)
SCAN
(ii) C-SCAN.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Blurred answer

Similar questions

Suppose that a disk drive has 6,000 cylinders, numbered 0 to 5,999. The drive is currently serving a request at cylinder 3,250, and the previous request was at cylinder 4,805. The queue of pending requests, in FIFO order, is:1515, 1212, 1296, 3800, 544, 618, 356, 2523, 5965, 4681Starting from the current head position, what is the total distance (in cylinders) that thedisk arm moves to satisfy all the pending requests for each of the following diskscheduling algorithms?a. FCFSb. SSTFc. SCANd. LOOK
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?
There must be 3 files at least. 1 Header file 1 cpp file and driver file/main fileSolve the formulated from using Link List and C++ QUESTION: Given a queue of integers of even length, rearrange the elements byinterleaving the first half of the queue with the second half of thequeue. Only a stack can be used as an auxiliary space. Use Linked Listto solve the task. Input : 11 12 13 14 15 16 17 18 19 20Output : 11 16 12 17 13 18 14 19 15 20
Q.No.1:Suppose in a Hospital, there are two physicians to dealwith patients. Patients of all ages come for their checkup. Physician ‘A’ is designatedas physician of old patients while physician ‘B’ has to check other patients.Many patients come to the hospital at the same time. There are two queuesof patients against each physician. If patient is an old man, he will stand in secondqueue; otherwise he will stand in first queue. Both doctors check their patients one byone on first come first served basis. Due to timing restriction of the hospital, each doctorcan check a maximum of 20 patients per day. You are required to write a program in C++ to implement the above scenario. It shouldbe clear that patients will be added on back/rear side of the queue and will be servedfrom front of the queue. Further, your program should use Queue as an array toimplement above scenario.
4. How did we decide to handle the possibility of queue underflow? Group of answer choices Assume as a precondition that it will not occur. Provide an isEmpty operation so a client can prevent underflow. Ignore it. Throw a QueueUnderflowException if it occurs. Throw a QueueUnderflowException if it occurs, and provide an isEmpty operation so a client can prevent underflow. 5. Assume you are using the text's array-based queue and have just instantiated a queue of capacity 10. You enqueue 5 elements and then dequeue 2 elements. Which indices of the internal array elements hold the remaining elements? Group of answer choices 0 to 2 1 to 3 2 to 4 0 to 4 7 to 9 6. Suppose you start with an empty queue and perform the following operations: enqueue 1, enqueue 2, dequeue, enqueue 3, enqueue 4, dequeue, enqueue 5. What are the resultant contents of the queue, from front to back? Group of answer choices 1, 2, 3, 4, 5 1, 3, 5 1, 2, 3 3, 4, 5 7. The text's…
8 In MaxPQ, suppose that a client calls insert() with an item that is larger thanall items in the queue, and then immediately calls delMax(). Assume that there areno duplicate keys. Is the resulting heap identical to the heap as it was before these operations? Answer the same question for two insert() operations (the first with a keylarger than all keys in the queue and the second for a key larger than that one) followedby two delMax() operations
Consider the following functions are called for an integer queue in order. What will be the final state of the queue after these operations?CreateQueue(Q);Enqueue(9, Q);Enqueue(1, Q);Dequeue(&x, Q);Enqueue(4, Q);ClearQueue(Q);Enqueue(1, Q);QueueGetFront(&x, Q);Enqueue(7, Q);Dequeue(&x, Q);Enqueue(9, Q);Enqueue(2, Q);Dequeue(&x, Q);Enqueue(3,Q);
Which of the following statements are true about implementing a queue using dynamically linked nodes? The size of the queue cannot be obtained with O(1) time complexity if the variable that keeps track of the number of items is not maintained. If only a head pointer is used, the dequeue operation will have a time complexity of O(n). If only a head pointer is used, the enqueue operation will have a time complexity of O(n).
Some applications require two types of accesses to the critical section-read access and write access. For these applications, it is reasonable for multiple read accesses to happen concurrently. However, a write access cannot happen concurrently with either a read access or a write access. Example: For a sequence [R1, R2, W1, R3] of requests, R1 and R2 should be able to access the critical section concurrently while W1 and R3 wait in the queue. Once R1 and R2 leave the critical section, W1 can enter the critical section while R3 waits in the queue. (a) Modify Lamport's algorithm for such applications. (b) Modify Ricart and Agrawala's algorithm for such applications.
Assume that a client uses insert() with an item that is larger than all of the queue's items and then immediately calls delMax() in MaxPQ. Assume that no duplicate keys exist. Is the resultant heap the same as it was before these operations? Answer the same question for two insert() actions (one with a key bigger than all keys in the queue and one with a key greater than that one), followed by two delMax() operations.
Suppose we are building a B-Tree. Pages are 4008 bytes. A key value takes 8 bytes, and a pointer to a tree node or a record takes 8 bytes. a) What is the maximum number of keys in each node? b) Calculate the maximum number of pages N, which can be indexed with anindex file with height, h=2 and m keys (m is calculated in part a)? c) How many I/O operations are required for searching through N pages using a sorted file (N is calculated in part b)?.
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:…

SEE MORE QUESTIONS

Recommended textbooks for you

Programming Logic & Design Comprehensive

Programming Logic & Design Comprehensive

Computer Science

ISBN:

9781337669405

Author:

FARRELL

Publisher:

Cengage

Programming Logic & Design Comprehensive

Programming Logic & Design Comprehensive

Computer Science

ISBN:

9781337669405

Author:

FARRELL

Publisher:

Cengage

SEE MORE TEXTBOOKS