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
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
- Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer, Register Transfer and Microoperations
- Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Amplitude Modulation, Communication Fundamentals and Bandpass Signals, Random Processes, Angle Modulation, Superheterodyne Receivers and Phase-Locked Loops, Noise in Communication Systems, Pulse Modulation and Pulse Code Modulation, Baseband Digital Transmission, Signal Space and Optimum Detection, Digital Modulation, Information Theory and Source Coding, Error Control Coding, Multiplexing and Multiple Access, Wireless, Satellite and Optical Communication Systems, Impedance Matching and Microwave Networks, Continuous-Time Fourier Transform, Radio Links and Propagation, Continuous-Time Fourier Series, System Properties and LTI Systems, Data Converters, Sampling and Reconstruction
- Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, OOPS with Java, Generic & Collections, Object Oriented Technology
- Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- 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, Linux OS, Windows OS
- Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
- Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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 | Internet & Web Technologies: Website, Browser & Services, Web Design & Development, Web Publishing & Hosting, Server Side & Security, HTML Basics, JavaScript-Basics, CSS, XML, HTML5, Basics of Computer Graphics
- Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends, Internet of Things, Network Security, Security in Mobile and Wireless Computing, Cyber Safety and Security, Cyber Threats and Malware Attacks, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics
- Paper 2 | Cloud Technology: Cloud Computing
- Paper 2 | Probability and statistics: Probability, Statistics
- Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Analogy and Classification, Prepositions and Conjunctions, Sentence Completion, Reading Comprehension, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Sentence Structure and Correction, Articles and Determiners, Narrative Sequencing, Subject-Verb Agreement, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Vocabulary, Verb, Sentence Construction, Modals, Adverb
- Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, 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, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Mensuration and Geometry, Mental Ability, Arithmetic, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Geometry, Powers, Surds and Logarithms, Number System, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Alphabet and Word Tests, Sequences and Series, Trigonometry, Simplification and Approximation, Mathematical Operations, Constraint Puzzles, Numerical Reasoning, Series Completion, Patterns in Two-Dimensional Figures, Coding and Decoding, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Probability, Mensuration, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Combinatorics
- Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General 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.

