SCAN Scheduling
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
- Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
- Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
- Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
- IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
- IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics Network Security
- IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
- IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
- IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
- IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
- IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
- IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
- IT Mains: Mobile App Development: Mobile Computing Multimedia
- IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video delivers a comprehensive lecture on the SCAN disk scheduling algorithm, also known as the Elevator algorithm. The instructor begins by defining the core mechanism: the disk arm starts at one end of the disk and moves towards the other, servicing requests as it reaches each track. Upon reaching the end, the direction is reversed, and servicing continues. He uses visual aids to illustrate the arm's trajectory. He analyzes the impact of request arrival times on waiting periods, noting that requests behind the head must wait for the reversal. The session concludes with a structured breakdown of the algorithm's advantages, such as simplicity and lack of starvation, and disadvantages, including potential long waits for recently visited locations and unnecessary travel to disk ends.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a slide titled "SCAN" displaying a paragraph explaining the algorithm's operation. The text states, "The disk arm starts at one end of the disk and moves towards the other end, servicing requests as it reaches each track." The instructor explains that at the other end, the direction is reversed, and servicing continues. He draws a large circle to represent the disk and a line to represent the arm, illustrating the back-and-forth movement. He explicitly mentions the comparison to an elevator, stating the arm behaves "just like an elevator in a building."
2:00 – 5:00 02:00-05:00
The instructor delves into the specifics of request handling. He points to the slide text which reads, "If a request arrives in the queue just in front of the head, it will be serviced almost immediately." He contrasts this with requests behind the head, which must wait until the arm moves to the end, reverses direction, and comes back. He discusses the "uniform distribution of requests for cylinders," explaining that when the head reaches one end and reverses, "relatively few requests are immediately in front of the head since these cylinders have recently been serviced." He notes the heaviest density is at the other end.
5:00 – 7:09 05:00-07:09
The slide changes to list "Advantages" and "Disadvantages." Under advantages, the text lists "Simple easy to understand and use," "No starvation but more wait for some random process," and "Low variance and Average response time." Under disadvantages, it lists "Long waiting time for requests for locations just visited by disk arm" and "Unnecessary move to the end of the disk, even if there is no request." The instructor uses his diagram to demonstrate the "unnecessary move," drawing a line to the edge to show travel.
The lecture systematically builds understanding of the SCAN algorithm, moving from a textual definition to a visual demonstration of the arm's movement and request density. The instructor connects the mechanical movement to performance metrics, explaining why the algorithm avoids starvation but suffers from specific latency issues. The final slide provides a concise summary of pros and cons, reinforcing the key takeaways for students regarding the trade-offs involved in using the SCAN scheduling method.

