SRTF Advantage Vs Disadvantage
Duration: 8 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Data Structures - Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Object Oriented Programming (OOPS), Programming in C++, Java, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends
- Artificial Intelligence: Artificial Intelligence
- Unit Test - Professional Knowledge:
- Full Length Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture provides a detailed analysis of the Shortest Job First (SJF) CPU scheduling algorithm, focusing on its pros and cons. The instructor begins by establishing the theoretical superiority of the pre-emptive version, noting it guarantees minimal average waiting time and is often called the "optimal algorithm." He explains that it sets a standard for other algorithms and provides better response times than FCFS. The lecture then shifts to the critical disadvantages, highlighting that the algorithm is practically unimplementable because the system cannot predict the length of the next CPU burst. This limitation causes "starvation," where long processes wait indefinitely. The instructor uses a visual analogy of a busy street food stall to illustrate how longer processes suffer from poor response times and starvation.
Chapters
0:00 – 2:00 00:00-02:00
The instructor focuses on the "Advantage" slide. He reads and underlines the first point: "Pre-emptive version guarantees minimal average waiting time so some time also referred as optimal algorithm." He emphasizes that "Pre-emptive version" is key here. He explains that because it minimizes waiting time, it is mathematically optimal. He then moves to the second point, "Provide a standard for other algo in terms of average waiting time," underlining "Provide a standard." He explains that other algorithms are judged against SJF's performance. Finally, he discusses the third point, "Provide better average response time compare to FCFS," underlining "Provide better average response time." He contrasts this with FCFS, where a long process at the front can delay short processes.
2:00 – 5:00 02:00-05:00
The slide changes to "Disadvantage." The instructor underlines the first point: "This algo cannot be implemented as there is no way to know the length of the next CPU burst." He stresses that "cannot be implemented" is the core issue. The second point states, "Here process with the longer CPU burst requirement goes into starvation." He underlines "longer CPU burst requirement" and circles "starvation." The third point reads, "No idea of priority, longer process has poor response time." He underlines "No idea of priority." An image of a street vendor serving customers is displayed, which he uses as a visual aid to explain the concept of waiting lines and how some people (processes) might wait much longer than others.
5:00 – 7:55 05:00-07:55
The instructor elaborates on the starvation problem using the visual analogy. He explains that if short processes keep arriving, the long process at the back of the queue never gets served. He circles "starvation" again to reinforce the concept. He discusses the third point, "No idea of priority," explaining that without priority, a long process has poor response time. He mentions that this is why pure SJF is not used; instead, approximations are made. He gestures towards the image of the food stall, comparing the customers waiting for food to processes waiting for the CPU. He concludes that while SJF is theoretically optimal, its practical implementation is flawed due to the unpredictability of CPU bursts.
The lecture bridges the gap between theory and practice for SJF. It confirms the algorithm's theoretical optimality for waiting time but clearly identifies the fatal flaw of unimplementability due to unknown burst lengths. This leads to the critical issue of starvation, where long processes are neglected. The visual analogy of the food stall effectively grounds the abstract concept of starvation in a relatable real-world scenario, helping students understand why priority scheduling or aging techniques are necessary in real operating systems.

