L-6.4: FCFS in Disk scheduling with Example | Operating System

1.4M views
•
May 8, 2018
by
Gate Smashers
YouTube video player
L-6.4: FCFS in Disk scheduling with Example | Operating System

Transcript

Hello friends, welcome to the Gate Smashers the topic is first come first serve in disk scheduling algorithm So here first of all I'm going to discuss with the question a disk contains 200 tracks the numbering is 0 to 199 Request queue contains the track numbers 82 170 43 140 24 16 190 This is the details or this is the list of the track numbers O... Read More

Install to Summarize YouTube Videos and Get Transcripts

Explore YouTube Video Summarizer or Get YouTube Transcript Extractor

Read in Other Languages (beta)

English

Share This Summary 📚

Explore More Summaries from Gate Smashers 📚

L-5.19: Virtual Memory | Page fault | Significance of virtual memory | Operating System thumbnail
L-5.19: Virtual Memory | Page fault | Significance of virtual memory | Operating System
Gate Smashers
L-3.6: Test and Set Instruction in OS | Process Synchronization thumbnail
L-3.6: Test and Set Instruction in OS | Process Synchronization
Gate Smashers
What Is the Divide and Conquer Approach in Algorithms? thumbnail
What Is the Divide and Conquer Approach in Algorithms?
Gate Smashers
Lec-5: What is Grammar in TOC | Must Watch thumbnail
Lec-5: What is Grammar in TOC | Must Watch
Gate Smashers
What Are the Different Types of Registers in Computer Architecture? thumbnail
What Are the Different Types of Registers in Computer Architecture?
Gate Smashers
Lec-15: What is Hypervisor | Types of Hypervisor thumbnail
Lec-15: What is Hypervisor | Types of Hypervisor
Gate Smashers