L-6.6: SCAN Algorithm in Disk scheduling with Example | Operating System

preview_player
Показать описание

In SCAN disk scheduling algorithm, head starts from one end of the disk and moves towards the other end, servicing requests in between one by one and reach the other end. Then the direction of the head is reversed and the process continues as head continuously scan back and forth to access the disk. So, this algorithm works as an elevator and hence also known as the elevator algorithm.

►Operating System (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Рекомендации по теме
Комментарии
Автор

Thanku Sir g🙏
Best teacher on YouTube
Sir T-Shirt is Nice "Gate Smashers"
A small advice Sir... Your Channel Logo should also be on T-Shirt

sumitshokeen
Автор

SCAN be like " ek baar jo maine direction change kar di....fir to mai apne aap ki bhi nehi sunta " :D

paulsnehasish
Автор

Sir i got above 90 till now in all semesters in CS. I'm not preparing at all. I just watch ur videos and making notes of it and reading it before exams😁😁 thank you sir for my success 🤩🤩 bless me🙏🙏🙇🏽‍♂️

abhishekabhi
Автор

Thanks for your lectures.. I have successfully qualified UGC NET this June :)

indianjam
Автор

Really Helpful Lectures
Hope this channel will grow more
Thank you sir 🙏

ishansharma
Автор

Sir you are the beast in teaching sir, make vedios on other subjects also, I am flattered by the way you teach, I fell elevated

Flowereacer
Автор

I remember desperately waiting and watching your videos five years back since I was a NET aspirant. Five years later, I'm watching the same videos, but now as a professor. Nothing changed. Back then you were helping a student, now helping a teacher. Time flies! :D

shaguftakhan
Автор

Sir If we take Direction towards the lesser Value the Answer is Different
(50-0)+(190-0)=240

deepanshutyagi
Автор

Sir i studied in galvin that we should move to the left first in scan scheduling and do d vice versa in cscan whivh is called an elevator scan!

sunitighosh
Автор

basically i am from tamil nadu (hindi nahi hai)but, even i could understand the video.thanks a lot sir.

saravanavel
Автор

Thanks sir, sir your explanation way is the best..

vidhisharmachampion
Автор

thank you sir bahut achhe se samjh Me aaya

yourcookingcorner
Автор

Thanks a lot sir.. You are doing a great job

tapanjeetroy
Автор

on solving, wont the answer be same for both the ways sir, left to right and right to left..

luci
Автор

Thank you sir very best tutorial it is !!

shravankumarsakri
Автор

Supeb sir kal meri exam he aur aaj me betha hu pdne. Aur smjh me bhi aa rha he

MohdAsif-xyff
Автор

Agr shorter value side jane pr hme jyda optimal solution mil rha h to .
To har baar initially shorter value ke side jana hi better hoga kya?

yogesh
Автор

Sir what if silender movement not given?

shabbir.j.kholiya
Автор

What if the direction is not given in the question.. Then towards which direction should we move..towards larger or towards smaller??

jishnuvjn
Автор

I have a question I have exams tomorrow. Our professor doesn't give us direction so in that case should i go to the nearest one and same direction or it goes up even if the nearest value is small?
this is what we have in our lecture:
"""Lift algorithm, SCAN” : keep moving in the samedirection until no requests ahead (start Up):"""

kaushalbeast