First Come First Serve Scheduling

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/operating-system/disc-scheduling/fcfs-sstf-scheduling/asset-first-come-first-serve-scheduling after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  2. DataBase Management System/DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, 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
  10. Theory Of Computation/Automata Theory: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  11. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics
  13. General Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Time and Work, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Interjection, Verb, Articles, Adverb, Modals, Sentence Construction
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video lecture focuses on the First Come First Serve (FCFS) disk scheduling algorithm, a fundamental concept in operating systems. The instructor begins by defining FCFS as the simplest form of disk scheduling where requests are serviced strictly in the order they arrive in the queue. He emphasizes that while the algorithm is intrinsically fair and prevents starvation, it generally fails to provide the fastest service because it does not optimize seek time. The lecture transitions into a practical demonstration where the instructor writes a sequence of cylinder numbers on the whiteboard and uses a hand-drawn diagram of a disk to visualize the head movements, illustrating the inefficiencies of the algorithm through a concrete numerical example.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the topic using a presentation slide titled FCFS (First Come First Serve). The slide text explicitly states, The simplest form of disk scheduling is, of course, the first-come, first-served (FCFS) algorithm. He reads and explains the advantages listed on the slide, such as Easy to understand easy to use and Every request gets a fair chance. He also points out the disadvantage that it Does not try to optimize seek time (extra seek movements). The instructor notes that while there is no starvation, the system may suffer from convoy effect. He begins to draw a large circle on the right side of the screen to represent the disk platter.

  2. 2:00 – 5:00 02:00-05:00

    The instructor sets up a specific numerical example to calculate seek time. He writes a sequence of numbers on the board: 50, 27, 71, 97, 3, 54. He circles the first number, 50, indicating the initial head position. He explains that the head must move from 50 to 27, then to 71, and so on, following the arrival order. He writes the calculation |50 - 27| to demonstrate how the distance is found. He draws concentric circles on the disk diagram to represent different cylinders. He draws arrows on the diagram to show the head moving from the outer tracks to inner tracks and back, visually demonstrating the extra seek movements mentioned in the disadvantages.

  3. 5:00 – 5:42 05:00-05:42

    The instructor continues the calculation, summing up the individual seek times to find the total. He writes T.T = ... on the board and lists the absolute differences like |50 - 27| and |71 - 27|. He points to the diagram, tracing the path of the disk head as it jumps between cylinders 50, 27, 71, 97, 3, and 54. He emphasizes that this back-and-forth movement is inefficient compared to other algorithms. He concludes the segment by reiterating that while FCFS is simple and fair, the lack of optimization leads to longer wait times for processes, validating the convoy effect mentioned earlier.

The video effectively bridges theory and practice. It starts with a clear definition and a list of pros and cons from a slide, establishing the theoretical framework. It then moves to a hands-on example where the instructor writes down specific numbers and draws a diagram, making the abstract concept of seek time concrete. The progression from reading the slide to calculating |50 - 27| and drawing the disk path helps students visualize why FCFS is considered inefficient despite its fairness.

Loading lesson…