L-6.7: LOOK Algorithm in Disk scheduling with Example | Operating System

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

The LOOK algorithm is a disk scheduling algorithm that serves requests generated by the memory management unit. It is similar to the SCAN algorithm, as it evaluates the pending requests on both sweep directions of the disk head.

►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:
Рекомендации по теме
Комментарии
Автор

SCAN ( till end ) vs Look ( till last request in that direction ) Just for my revision. Thankyou sir

LearnerHarshalRajeshJain
Автор

Thanks for making Disc Scheduling Algorithm too easy....

amanpatel
Автор

Thank you so much Sir for this detailed & easy to understand explanation 🙏😊💐

indiradas
Автор

Great explanation for all scheduling 👌

nishkarshdahiya
Автор

Sir i understand full concept of disk scheduling sir can u make videos on
File system structure, allocation method, free space management, mass storage structure and divice drivers. your lectures really very helpful to many students
Thank you sir🙏🙏🙏

monukumar-pmyl
Автор

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

tapanjeetroy
Автор

Best explanation sir.. Thank you so much.

kittushrivaas
Автор

My exammm... U saved me from getting a backlog.. thanks a lot to yiu

sushmithar
Автор

Only because of you I can have my lost lectures back ... grateful sir 🙏🏻🙏🏻🙏🏻

aniketmasram
Автор

too good video understood the concept even before playing the video

surajpukkalla
Автор

Sir, what if we don't have direction? So which direction we should go.

parth_pandya
Автор

Plz add more videos of disk scheduling and file structure

shreyagupta
Автор

very useful sir... my exam is on 25th and these videos are really helpful

antisocial
Автор

Sir i think there is a mistake... that's when we come to reversed direction we touch the lowest one first ...then go to the increasing value.... isn't it?

soumyajitseth
Автор

Sir agr Hume direction nhi di ho to kya hm khud se direction le sakte hhh??

gayatrimangal
Автор

Sir moving form 199 to 0 or moving from 0 to 199. Kya dono same hai aur jaise apne explain Kiya hai wyse hi bnana hai . Please reply

rishavkumar
Автор

Sir agar notes bhi mil jate to achha rahta. Pls sir note bhi description me dal do na.

prafullepili
Автор

then what is the diffrence between in sstf and look

mohitgaur
Автор

if the question comes like previously it was at 82 position what will do in that case for look scheduling according to your question

saudimran
Автор

Sir SSTF or LOOK similar hi hoti h kya???

aayushmankotia