Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider a disk system with 100 cylinders. Th...
Start Learning for Free
Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:
16, 24, 7, 9, 25, 11, 8, 87
Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?
Correct answer is '181'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Consider a disk system with 100 cylinders. The requests to access the ...
(58 – 16) + (24 - 16) + (24 - 7) + (9 - 7) + (25 - 9) + (25 - 11) + (11 - 8) + (87 - 8)
= 42 + 8 + 17 + 2 + 16 + 14 + 3 + 79
= 181 ms
Most Upvoted Answer
Consider a disk system with 100 cylinders. The requests to access the ...
First Come First Serve (FCFS) Disk Scheduling Algorithm
The First Come First Serve (FCFS) disk scheduling algorithm is a simple disk scheduling algorithm where the requests are executed in the order they arrive. In this algorithm, the head moves from its current position to the first request cylinder and then processes the subsequent requests in the order they were received.
Given Information:
- Total number of cylinders: 100
- Cylinder requests sequence: 16, 24, 7, 9, 25, 11, 8, 87
- Current position of the head: 58
Steps to Calculate the Time Taken:
1. Calculate the total distance the head needs to travel:
- Start with the current head position (58).
- Calculate the absolute difference between the current head position and the first request cylinder (16). Add this value to the total distance.
- Update the current head position to the first request cylinder (16).
- Repeat the above steps for all subsequent request cylinders, adding the absolute difference to the total distance.
- The final total distance is the sum of all absolute differences.
2. Calculate the time taken based on the total distance:
- As per the question, each cylinder access takes 1 ms.
- Multiply the total distance by the time taken per cylinder access (1 ms) to get the total time taken.
Calculating the Total Distance:
- Absolute difference between 58 and 16: |58 - 16| = 42
- Absolute difference between 16 and 24: |16 - 24| = 8
- Absolute difference between 24 and 7: |24 - 7| = 17
- Absolute difference between 7 and 9: |7 - 9| = 2
- Absolute difference between 9 and 25: |9 - 25| = 16
- Absolute difference between 25 and 11: |25 - 11| = 14
- Absolute difference between 11 and 8: |11 - 8| = 3
- Absolute difference between 8 and 87: |8 - 87| = 79
Total distance = 42 + 8 + 17 + 2 + 16 + 14 + 3 + 79 = 181
Calculating the Time Taken:
Total time taken = Total distance * Time taken per cylinder access
= 181 * 1 ms
= 181 ms
Therefore, the time taken to satisfy all the requests using the First Come First Serve (FCFS) disk scheduling algorithm is 181 ms.
The First Come First Serve (FCFS) disk scheduling algorithm is a simple disk scheduling algorithm where the requests are executed in the order they arrive. In this algorithm, the head moves from its current position to the first request cylinder and then processes the subsequent requests in the order they were received.
Given Information:
- Total number of cylinders: 100
- Cylinder requests sequence: 16, 24, 7, 9, 25, 11, 8, 87
- Current position of the head: 58
Steps to Calculate the Time Taken:
1. Calculate the total distance the head needs to travel:
- Start with the current head position (58).
- Calculate the absolute difference between the current head position and the first request cylinder (16). Add this value to the total distance.
- Update the current head position to the first request cylinder (16).
- Repeat the above steps for all subsequent request cylinders, adding the absolute difference to the total distance.
- The final total distance is the sum of all absolute differences.
2. Calculate the time taken based on the total distance:
- As per the question, each cylinder access takes 1 ms.
- Multiply the total distance by the time taken per cylinder access (1 ms) to get the total time taken.
Calculating the Total Distance:
- Absolute difference between 58 and 16: |58 - 16| = 42
- Absolute difference between 16 and 24: |16 - 24| = 8
- Absolute difference between 24 and 7: |24 - 7| = 17
- Absolute difference between 7 and 9: |7 - 9| = 2
- Absolute difference between 9 and 25: |9 - 25| = 16
- Absolute difference between 25 and 11: |25 - 11| = 14
- Absolute difference between 11 and 8: |11 - 8| = 3
- Absolute difference between 8 and 87: |8 - 87| = 79
Total distance = 42 + 8 + 17 + 2 + 16 + 14 + 3 + 79 = 181
Calculating the Time Taken:
Total time taken = Total distance * Time taken per cylinder access
= 181 * 1 ms
= 181 ms
Therefore, the time taken to satisfy all the requests using the First Come First Serve (FCFS) disk scheduling algorithm is 181 ms.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Top Courses for Computer Science Engineering (CSE)View all
Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:16, 24, 7, 9, 25, 11, 8, 87Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?Correct answer is '181'. Can you explain this answer?
Question Description
Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:16, 24, 7, 9, 25, 11, 8, 87Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?Correct answer is '181'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:16, 24, 7, 9, 25, 11, 8, 87Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?Correct answer is '181'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:16, 24, 7, 9, 25, 11, 8, 87Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?Correct answer is '181'. Can you explain this answer?.
Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:16, 24, 7, 9, 25, 11, 8, 87Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?Correct answer is '181'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:16, 24, 7, 9, 25, 11, 8, 87Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?Correct answer is '181'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:16, 24, 7, 9, 25, 11, 8, 87Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?Correct answer is '181'. Can you explain this answer?.
Solutions for Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:16, 24, 7, 9, 25, 11, 8, 87Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?Correct answer is '181'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:16, 24, 7, 9, 25, 11, 8, 87Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?Correct answer is '181'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:16, 24, 7, 9, 25, 11, 8, 87Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?Correct answer is '181'. Can you explain this answer?, a detailed solution for Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:16, 24, 7, 9, 25, 11, 8, 87Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?Correct answer is '181'. Can you explain this answer? has been provided alongside types of Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:16, 24, 7, 9, 25, 11, 8, 87Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?Correct answer is '181'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:16, 24, 7, 9, 25, 11, 8, 87Assuming that the head is currently at cylinder 58, what is the time taken (in ms) to satisfy all requests if first come first serve policy is used?Correct answer is '181'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup