SJF Scheduling

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/operating-system/cpu-scheduling/sjf-srtf-scheduling/asset-sjf-scheduling after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. 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
  4. 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
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. 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
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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
  10. 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
  11. 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
  12. 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
  13. 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
  14. 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
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. 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
  18. 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
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture provides a comprehensive overview of CPU scheduling algorithms, specifically focusing on Shortest Job First (SJF) and Shortest Remaining Time First (SRTF). The instructor begins by defining the core principle of these algorithms: selecting the process with the smallest burst time for CPU execution. He distinguishes between the non-preemptive nature of SJF and the preemptive nature of SRTF, noting that SRTF is a 'purely greedy approach.' The lecture then transitions into a detailed numerical problem involving five processes. The instructor demonstrates how to construct a Gantt chart, calculate Completion Time (CT), Turn Around Time (TAT), and Waiting Time (WT) for each process, and finally compute the average waiting time. This practical application reinforces the theoretical concepts introduced at the start of the session.

Chapters

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

    The video opens with a slide titled 'Shortest Job First (SJF)(non-pre-emptive)' and 'Shortest Remaining Time First (SRTF)/ (Shortest Next CPU Burst) (Pre-emptive)'. The instructor explains the fundamental rule: 'Whenever we make a decision of selecting the next process for CPU execution, out of all available process, CPU is assigned to the process having smallest burst time requirement.' He clarifies that if there is a tie in burst times, First Come First Serve (FCFS) is used to break the tie. He also notes that SRTF is a 'purely greedy approach' because it supports both non-preemptive and preemptive versions. The instructor emphasizes that the decision is made based on the smallest burst time requirement among available processes. The slide text explicitly states: 'When the CPU is available, it is assigned to the process that has the smallest next CPU burst.'

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

    The instructor focuses on the non-preemptive nature of SJF. He writes on the whiteboard: 'In Shortest Job First (SJF)(non-pre-emptive) once a decision is made and among the available process, the process with the smallest CPU burst is scheduled on the CPU, it cannot be pre-empted even if a new process with the smaller CPU burst requirement then the remaining CPU burst of the running process enter in the system.' He draws a small example table with processes P1, P2, and P3, listing their Arrival Time (AT) and Burst Time (BT) to illustrate the concept. He explains that once a process starts, it runs to completion regardless of new arrivals with shorter burst times. This section sets the theoretical groundwork for the numerical problem that follows. He specifically writes 'P1 0 5', 'P2 0 4', 'P3 1 1' on the board to show a scenario where P1 starts but P3 arrives later with a smaller burst.

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

    The instructor solves a numerical problem with five processes (P0 to P4). A table shows Arrival Times (1, 2, 3, 4, 5) and Burst Times (7, 5, 1, 2, 8). He draws a Gantt chart at the bottom. P0 arrives at t=1 and runs for 7 units, finishing at t=8. At t=8, P2 (BT=1) is selected as it has the smallest burst time among available processes (P1, P2, P3, P4). P2 runs from 8 to 9. Next, P3 (BT=2) is selected, running from 9 to 11. Then P1 (BT=5) runs from 11 to 16. Finally, P4 (BT=8) runs from 16 to 24. He calculates Completion Time (CT), Turn Around Time (TAT = CT - AT), and Waiting Time (WT = TAT - BT) for each process. For example, P0 has CT=8, TAT=7, WT=0. P1 has CT=16, TAT=14, WT=9. P2 has CT=9, TAT=6, WT=5. P3 has CT=11, TAT=7, WT=5. P4 has CT=24, TAT=19, WT=11. He concludes by calculating the average waiting time. The formulas are clearly written on the slide: 'Turn Around Time (TAT) = CT - AT' and 'Waiting Time (WT) = TAT - BT'.

The lecture effectively transitions from theoretical definitions to practical application. It starts by defining SJF and SRTF, highlighting the key difference in preemption. The instructor then demonstrates the non-preemptive logic with a small board example before tackling a comprehensive numerical problem. The step-by-step calculation of CT, TAT, and WT, along with the Gantt chart, provides a clear method for solving scheduling problems. This progression ensures students understand both the 'why' and the 'how' of CPU scheduling algorithms. The 'purely greedy approach' mentioned is key to understanding why SRTF minimizes waiting time.

Loading lesson…