SCAN & LOOK Algorithm in Disk Scheduling Problem Explained in Tamil

Поделиться
HTML-код
  • Опубликовано: 2 фев 2025

Комментарии • 7

  • @karthikakarthi6578
    @karthikakarthi6578 3 года назад +2

    your classes are very very useful for us mam.keep teaching us😊

  • @Pradhap007
    @Pradhap007 6 месяцев назад

    Clear Explanation Mam Fantastic

  • @TUCSKISHORES
    @TUCSKISHORES 2 года назад +1

    A disk drive has 200 cylinders, numbered 0 to 99. The drive is
    currently serving a request at cylinder 53. The queue of
    pending requests, in FIFO order is,
    98, 183, 37, 122, 14, 124, 65, 67.
    Starting from the current head position, what is the total
    distance (in cylinders) that the arm moves to satisfy all the
    pending requests for each of the following disk-scheduling
    algorithms?
    a. FCFS b. SSTF c. SCAN d. LOOK e. C-SCAN f. C-LOOK.
    Mam ipo question la 85 mention panala mam ipo entha direction move pananu
    Please reply

    • @sglectures6072
      @sglectures6072  2 года назад

      if nothing has been specified about previous request, you can move in any one direction, choice is urs

  • @saikishore1593
    @saikishore1593 2 года назад

    Thank you mam