Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Questions  >  A disk drive has 200 cylinders, numbered 0 to... Start Learning for Free
A disk drive has 200 cylinders, numbered 0 to 199. Disk requests come to the disk driver for cylinders 82, 170, 43, 140, 24, 16 and 190. The driver is currently serving a request at a cylinder 50. How much seek time is needed for the FCFS algorithm?
    Correct answer is '642'. Can you explain this answer?
    Most Upvoted Answer
    A disk drive has 200 cylinders, numbered 0 to 199. Disk requests come ...
    Seek Time Calculation for FCFS Algorithm

    To calculate the seek time for the FCFS (First-Come, First-Served) algorithm, we need to consider the order in which the disk requests are processed. The seek time is the total amount of time required for the disk arm to move from one cylinder to another.

    Given data:
    - Disk drive has 200 cylinders numbered from 0 to 199.
    - Disk requests: 82, 170, 43, 140, 24, 16, and 190.
    - Current cylinder: 50.

    Step 1: Calculate the distance between each consecutive cylinder request
    To calculate the seek time, we need to calculate the distance between each consecutive cylinder request. The distance is the absolute difference between two cylinder numbers.

    Distance between 50 and 82 = |82 - 50| = 32
    Distance between 82 and 170 = |170 - 82| = 88
    Distance between 170 and 43 = |43 - 170| = 127
    Distance between 43 and 140 = |140 - 43| = 97
    Distance between 140 and 24 = |24 - 140| = 116
    Distance between 24 and 16 = |16 - 24| = 8
    Distance between 16 and 190 = |190 - 16| = 174

    Step 2: Calculate the total seek time
    The total seek time is the sum of the distances calculated in step 1.

    Total seek time = 32 + 88 + 127 + 97 + 116 + 8 + 174 = 642

    Therefore, the correct answer is 642, which represents the total seek time required for the FCFS algorithm to process all the given disk requests starting from cylinder 50.
    Free Test
    Community Answer
    A disk drive has 200 cylinders, numbered 0 to 199. Disk requests come ...
    FCFS is the simplest disk scheduling algorithm. As the name suggests, this algorithm entertains requests in the order they arrive in the disk queue. The algorithm looks very fair and there is no starvation (all requests are serviced sequentially) but generally, it does not provide the fastest service.
    Algorithm:
    1. Let Request array represents an array storing indexes of tracks that have been requested in ascending order of their time of arrival. ‘head’ is the position of disk head.
    2. Let us one by one take the tracks in default order and calculate the absolute distance of the track from the head.
    3. Increment the total seek count with this distance.
    4. Currently serviced track position now becomes the new head position.
    5. Go to step 2 until all tracks in the request array have not been serviced.
    Given,
    A disk drive has cylinders = 200
    They are numbered 0 to 199.
    Disk requests come to the disk driver for cylinders 82, 170, 43, 140, 24, 16 and 190.
    The driver is currently serving a request at a cylinder 50.
    So, total seek time:
    = (82 − 50) + (170 − 82) + (170 − 43) + (140 − 43) + (140 − 24) + (24 − 16) + (190 − 16)
    = 642
    Hence, the correct answer is 642.
    Explore Courses for Computer Science Engineering (CSE) exam

    Similar Computer Science Engineering (CSE) Doubts

    Top Courses for Computer Science Engineering (CSE)

    A disk drive has 200 cylinders, numbered 0 to 199. Disk requests come to the disk driver for cylinders 82, 170, 43, 140, 24, 16 and 190. The driver is currently serving a request at a cylinder 50. How much seek time is needed for the FCFS algorithm?Correct answer is '642'. Can you explain this answer?
    Question Description
    A disk drive has 200 cylinders, numbered 0 to 199. Disk requests come to the disk driver for cylinders 82, 170, 43, 140, 24, 16 and 190. The driver is currently serving a request at a cylinder 50. How much seek time is needed for the FCFS algorithm?Correct answer is '642'. 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 A disk drive has 200 cylinders, numbered 0 to 199. Disk requests come to the disk driver for cylinders 82, 170, 43, 140, 24, 16 and 190. The driver is currently serving a request at a cylinder 50. How much seek time is needed for the FCFS algorithm?Correct answer is '642'. 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 A disk drive has 200 cylinders, numbered 0 to 199. Disk requests come to the disk driver for cylinders 82, 170, 43, 140, 24, 16 and 190. The driver is currently serving a request at a cylinder 50. How much seek time is needed for the FCFS algorithm?Correct answer is '642'. Can you explain this answer?.
    Solutions for A disk drive has 200 cylinders, numbered 0 to 199. Disk requests come to the disk driver for cylinders 82, 170, 43, 140, 24, 16 and 190. The driver is currently serving a request at a cylinder 50. How much seek time is needed for the FCFS algorithm?Correct answer is '642'. 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 A disk drive has 200 cylinders, numbered 0 to 199. Disk requests come to the disk driver for cylinders 82, 170, 43, 140, 24, 16 and 190. The driver is currently serving a request at a cylinder 50. How much seek time is needed for the FCFS algorithm?Correct answer is '642'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of A disk drive has 200 cylinders, numbered 0 to 199. Disk requests come to the disk driver for cylinders 82, 170, 43, 140, 24, 16 and 190. The driver is currently serving a request at a cylinder 50. How much seek time is needed for the FCFS algorithm?Correct answer is '642'. Can you explain this answer?, a detailed solution for A disk drive has 200 cylinders, numbered 0 to 199. Disk requests come to the disk driver for cylinders 82, 170, 43, 140, 24, 16 and 190. The driver is currently serving a request at a cylinder 50. How much seek time is needed for the FCFS algorithm?Correct answer is '642'. Can you explain this answer? has been provided alongside types of A disk drive has 200 cylinders, numbered 0 to 199. Disk requests come to the disk driver for cylinders 82, 170, 43, 140, 24, 16 and 190. The driver is currently serving a request at a cylinder 50. How much seek time is needed for the FCFS algorithm?Correct answer is '642'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice A disk drive has 200 cylinders, numbered 0 to 199. Disk requests come to the disk driver for cylinders 82, 170, 43, 140, 24, 16 and 190. The driver is currently serving a request at a cylinder 50. How much seek time is needed for the FCFS algorithm?Correct answer is '642'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
    Explore Courses for Computer Science Engineering (CSE) exam

    Top Courses for Computer Science Engineering (CSE)

    Explore Courses
    Signup for Free!
    Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
    10M+ students study on EduRev