45, 81, 185, 33, 175, 99, 150, 77
(Consider that the head starts from location 58)
This question asks us to calculate the total head movement for a disk scheduling algorithm called C-SCAN (Circular SCAN). We are given a list of I/O requests to different cylinders and the starting position of the disk head. We need to find the total distance the head travels.
The C-SCAN algorithm is a variation of the SCAN algorithm. It works as follows:
In this problem, the head starts at cylinder 58 and moves in the right direction (towards higher cylinder numbers).
First, let's list the given I/O requests and the starting position:
Sorting the requests helps in determining the order of servicing:
| Sorted Requests: | 33, 45, 77, 81, 99, 150, 175, 185 |
The head starts at 58 and moves towards the right (higher cylinder numbers).
The total head movement is the sum of the movements in each step:
Total Movement = (Movement from 58 to 185) + (Movement from 185 to 199) + (Jump from 199 to 0) + (Movement from 0 to 45)
Total Movement = $(185 - 58) + (199 - 185) + (199 - 0) + (45 - 0)$
Total Movement = $127 + 14 + 199 + 45$
Total Movement = 385 cylinders.
Therefore, the total head movement for the C-SCAN disc scheduling technique, starting from cylinder 58 and moving in the right direction, is 385 cylinders.
Move the Read/Write head of disk in or out to position on a correct track is known as ______.
_______ is a process of lifting the process from memory and placing it on disk.
| List I | List II |
| A. RAID Level 2 | I. Block interleaved distribution parity |
| B. RAID Level 3 | II. Also known as P+Q redundancy Scheme |
| C. RAID Level 5 | III. Bit interleaved parity |
| D. RAID Level 6 | IV. Also known as Memory style error correcting code organization |