FCFS Scheduling
Duration: 10 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | 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
- Paper 2 | 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 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 Database Recovery
- Paper 2 | 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video presents a comprehensive educational session on the First Come First Serve (FCFS) CPU scheduling algorithm, a fundamental topic in operating systems. The instructor begins by defining FCFS as the simplest scheduling algorithm, emphasizing that the process requesting the CPU first is allocated the CPU first. Key characteristics are highlighted on the slide: implementation is managed by a FIFO (First In First Out) queue, and the algorithm is always non-preemptive in nature. The instructor uses a visual analogy of a queue at a ticket counter to reinforce the concept. Following the theoretical introduction, the lecture transitions into a practical numerical problem. A table is displayed listing five processes (P0, P1, P2, P3, P4) with their respective Arrival Times (AT) and Burst Times (BT). The instructor systematically solves the problem by first identifying the process with the earliest arrival time (P2 at time 0) to start the execution. He then constructs a Gantt chart at the bottom of the screen to visualize the sequence of process execution over time. Based on the Gantt chart, he calculates the Completion Time (CT) for each process. Subsequently, he computes the Turn Around Time (TAT) using the formula TAT = CT - AT and the Waiting Time (WT) using the formula WT = TAT - BT. The session concludes with the calculation of the average Turn Around Time and average Waiting Time for the set of processes, providing a complete performance analysis of the FCFS algorithm.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the FCFS algorithm. The slide displays the title 'FCFS (FIRST COME FIRST SERVE)' and bullet points stating it is the simplest scheduling algorithm, managed by a FIFO Queue, and is non-preemptive. The instructor explains that the process requesting the CPU first gets it first, using a background image of a queue to illustrate the concept. He underlines key terms like 'simplest' and 'FIFO Queue' on the slide.
2:00 – 5:00 02:00-05:00
The instructor sets up a numerical problem. A table appears with columns for P. No, Arrival Time (AT), and Burst Time (BT). The processes are P0 (AT=2, BT=4), P1 (AT=1, BT=2), P2 (AT=0, BT=3), P3 (AT=4, BT=2), and P4 (AT=3, BT=1). He identifies P2 as the first process because it has the earliest arrival time (0). He draws a Gantt chart, placing P2 from time 0 to 3. He then places P1 (arrived at 1) from 3 to 5, followed by P0 (arrived at 2) from 5 to 9, P4 (arrived at 3) from 9 to 10, and finally P3 (arrived at 4) from 10 to 12. He writes the process names and time intervals on the Gantt chart.
5:00 – 10:00 05:00-10:00
The instructor meticulously fills the table with calculated values. For process P2, he calculates Completion Time (CT) as 3, Turn Around Time (TAT) as 3-0=3, and Waiting Time (WT) as 3-3=0. For P1, CT is 5, TAT is 5-1=4, and WT is 4-2=2. For P0, CT is 9, TAT is 9-2=7, and WT is 7-4=3. For P4, CT is 10, TAT is 10-3=7, and WT is 7-1=6. For P3, CT is 12, TAT is 12-4=8, and WT is 8-2=6. He then calculates the averages: Average TAT is (3+4+7+7+8)/5 = 5.8, and Average WT is (0+2+3+6+6)/5 = 3.4. He writes these final calculations at the bottom of the table, showing the summation and division steps.
10:00 – 10:04 10:00-10:04
The video concludes with a final view of the completed table and Gantt chart, summarizing the entire solution process for the FCFS scheduling problem. The instructor stands next to the screen, indicating the end of the numerical example.
The lecture provides a clear progression from theoretical definition to practical application. It establishes FCFS as a non-preemptive, FIFO-based algorithm and then immediately demonstrates its execution logic through a step-by-step numerical example. By manually constructing the Gantt chart and deriving performance metrics like Turn Around Time and Waiting Time, the instructor illustrates how arrival times dictate the execution order and how these factors impact overall system efficiency. The final calculation of averages offers a quantitative measure of the algorithm's performance for the given set of processes.

