Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > There are 200 tracks on a disk platter and th...
Start Learning for Free
There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?
- a)Elevator
- b)Shorter Seek time First
- c)C-SCAN
- d)First Come First Served
Correct answer is option 'C'. Can you explain this answer?
Verified Answer
There are 200 tracks on a disk platter and the pending requests have c...
Option 1:
The elevator algorithm is also known as the SCAN algorithm.
The elevator algorithm is also known as the SCAN algorithm.
In this algorithm, the disk moves in a particular direction servicing the requests coming in the way till the end & reverse the direction & service all the requests.
Option 2:
In Shortest Seek Time First(SSTF), the algorithm selects disk I/O which requires the least disk arm movement from the current position
In Shortest Seek Time First(SSTF), the algorithm selects disk I/O which requires the least disk arm movement from the current position
Option 3:
In C-scan i.e. Circular Elevator, the disk moves in a particular direction servicing the requests coming in the way till the end & reverse the direction & again goes to the start point & starts servicing the requests once reach the start point.
In C-scan i.e. Circular Elevator, the disk moves in a particular direction servicing the requests coming in the way till the end & reverse the direction & again goes to the start point & starts servicing the requests once reach the start point.
Option 4:
In First Come First Serve(FCFS), the disk service the request that comes first.
Hence, the correct answer is "option 3".
In First Come First Serve(FCFS), the disk service the request that comes first.
Hence, the correct answer is "option 3".
Most Upvoted Answer
There are 200 tracks on a disk platter and the pending requests have c...
Explanation:
The given sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76. Based on this sequence, we need to determine the disk access scheduling policy used.
Elevator Scheduling (C-SCAN):
- The elevator scheduling algorithm, also known as C-SCAN, works by moving the arm in one direction until it reaches the end of the disk and then reversing its direction and moving back to the other end.
- In this case, the arm starts at track 100 and moves towards track 200. However, instead of reversing its direction at track 200, it continues moving towards track 0.
- So, based on the given sequence, the next track to be accessed should be the one closest to the current track in the direction of the movement. However, the given sequence does not follow this pattern, so elevator scheduling is not being used.
Shorter Seek Time First (SSTF):
- The SSTF algorithm selects the request with the shortest seek time from the current track.
- In this case, the next track to be accessed from the current track 100 would be 126, as it has the shortest seek time compared to the other pending requests.
- However, the given sequence does not follow this pattern, so SSTF is not being used.
C-SCAN:
- C-SCAN, also known as circular SCAN, is a variant of the SCAN algorithm that moves the arm only in one direction, servicing requests along the way, and when it reaches the end of the disk, it jumps back to the beginning without servicing any requests in the reverse direction.
- In this case, the given sequence matches the pattern of C-SCAN. The arm starts at track 100 and moves towards track 200, accessing tracks 126, 167, and 199 along the way. Then, it jumps back to the beginning and accesses track 12. Finally, it continues moving towards track 200 and accesses tracks 36, 42, 51, 69, and 76.
- Therefore, the disc access scheduling policy used is C-SCAN.
First Come First Served (FCFS):
- FCFS is the simplest disk scheduling algorithm where requests are serviced in the order they arrive.
- The given sequence does not follow the FCFS pattern as it does not consider the arrival order of the requests.
- Therefore, FCFS is not being used in this case.
Hence, the correct answer is option C) C-SCAN.
The given sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76. Based on this sequence, we need to determine the disk access scheduling policy used.
Elevator Scheduling (C-SCAN):
- The elevator scheduling algorithm, also known as C-SCAN, works by moving the arm in one direction until it reaches the end of the disk and then reversing its direction and moving back to the other end.
- In this case, the arm starts at track 100 and moves towards track 200. However, instead of reversing its direction at track 200, it continues moving towards track 0.
- So, based on the given sequence, the next track to be accessed should be the one closest to the current track in the direction of the movement. However, the given sequence does not follow this pattern, so elevator scheduling is not being used.
Shorter Seek Time First (SSTF):
- The SSTF algorithm selects the request with the shortest seek time from the current track.
- In this case, the next track to be accessed from the current track 100 would be 126, as it has the shortest seek time compared to the other pending requests.
- However, the given sequence does not follow this pattern, so SSTF is not being used.
C-SCAN:
- C-SCAN, also known as circular SCAN, is a variant of the SCAN algorithm that moves the arm only in one direction, servicing requests along the way, and when it reaches the end of the disk, it jumps back to the beginning without servicing any requests in the reverse direction.
- In this case, the given sequence matches the pattern of C-SCAN. The arm starts at track 100 and moves towards track 200, accessing tracks 126, 167, and 199 along the way. Then, it jumps back to the beginning and accesses track 12. Finally, it continues moving towards track 200 and accesses tracks 36, 42, 51, 69, and 76.
- Therefore, the disc access scheduling policy used is C-SCAN.
First Come First Served (FCFS):
- FCFS is the simplest disk scheduling algorithm where requests are serviced in the order they arrive.
- The given sequence does not follow the FCFS pattern as it does not consider the arrival order of the requests.
- Therefore, FCFS is not being used in this case.
Hence, the correct answer is option C) C-SCAN.
Free Test
FREE
| Start Free Test |
Community Answer
There are 200 tracks on a disk platter and the pending requests have c...
Option 1:
The elevator algorithm is also known as the SCAN algorithm.
The elevator algorithm is also known as the SCAN algorithm.
In this algorithm, the disk moves in a particular direction servicing the requests coming in the way till the end & reverse the direction & service all the requests.
Option 2:
In Shortest Seek Time First(SSTF), the algorithm selects disk I/O which requires the least disk arm movement from the current position
In Shortest Seek Time First(SSTF), the algorithm selects disk I/O which requires the least disk arm movement from the current position
Option 3:
In C-scan i.e. Circular Elevator, the disk moves in a particular direction servicing the requests coming in the way till the end & reverse the direction & again goes to the start point & starts servicing the requests once reach the start point.
In C-scan i.e. Circular Elevator, the disk moves in a particular direction servicing the requests coming in the way till the end & reverse the direction & again goes to the start point & starts servicing the requests once reach the start point.
Option 4:
In First Come First Serve(FCFS), the disk service the request that comes first.
Hence, the correct answer is "option 3".
In First Come First Serve(FCFS), the disk service the request that comes first.
Hence, the correct answer is "option 3".
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?a)Elevatorb)Shorter Seek time Firstc)C-SCANd)First Come First ServedCorrect answer is option 'C'. Can you explain this answer?
Question Description
There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?a)Elevatorb)Shorter Seek time Firstc)C-SCANd)First Come First ServedCorrect answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2025 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 There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?a)Elevatorb)Shorter Seek time Firstc)C-SCANd)First Come First ServedCorrect answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?a)Elevatorb)Shorter Seek time Firstc)C-SCANd)First Come First ServedCorrect answer is option 'C'. Can you explain this answer?.
There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?a)Elevatorb)Shorter Seek time Firstc)C-SCANd)First Come First ServedCorrect answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2025 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 There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?a)Elevatorb)Shorter Seek time Firstc)C-SCANd)First Come First ServedCorrect answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?a)Elevatorb)Shorter Seek time Firstc)C-SCANd)First Come First ServedCorrect answer is option 'C'. Can you explain this answer?.
Solutions for There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?a)Elevatorb)Shorter Seek time Firstc)C-SCANd)First Come First ServedCorrect answer is option 'C'. 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 There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?a)Elevatorb)Shorter Seek time Firstc)C-SCANd)First Come First ServedCorrect answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?a)Elevatorb)Shorter Seek time Firstc)C-SCANd)First Come First ServedCorrect answer is option 'C'. Can you explain this answer?, a detailed solution for There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?a)Elevatorb)Shorter Seek time Firstc)C-SCANd)First Come First ServedCorrect answer is option 'C'. Can you explain this answer? has been provided alongside types of There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?a)Elevatorb)Shorter Seek time Firstc)C-SCANd)First Come First ServedCorrect answer is option 'C'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice There are 200 tracks on a disk platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12, and 199, Assume the arm is located at the 100th track and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69, and 76 then which disc access scheduling policy is used?a)Elevatorb)Shorter Seek time Firstc)C-SCANd)First Come First ServedCorrect answer is option 'C'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup