Terminology for CPU Scheduling

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-SENIOR-COMPUTER-INSTRUCTOR/operating-systems/cpu-scheduling/basics-criteria/asset-terminology-for-cpu-scheduling after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
  10. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
  11. Paper-2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Distributed Systems
  12. Paper-2 | Database Management System: 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
  13. Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  15. Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  16. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  17. Paper 2 | Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  18. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
  19. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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, Network Security, Ethical Hacking
  20. Paper-2 I Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  21. Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
  22. Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
  23. Pedagogy: Child Development, Concept of Pedagogy, Psychology, Theories, Inclusive Education, Experiential Pedagogy, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  24. Live Sessions: RSSB Live Sessions
  25. RSSB Paper 1 - Full Mock Tests:
  26. RSSB Paper 2 - Full Mock Tests:
  27. SCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive lecture on Operating Systems, specifically focusing on the fundamental terminology used in process scheduling algorithms. The instructor systematically defines key performance metrics such as Arrival Time (AT), Burst Time (BT), Completion Time (CT), Turn Around Time (TAT), and Waiting Time (WT). The lecture transitions from theoretical definitions to a practical application, where the instructor solves a sample problem involving two processes, P1 and P2. Through a step-by-step walkthrough, he demonstrates how to construct a Gantt chart-like timeline and populate a data table to calculate the final scheduling metrics, ensuring students understand the mathematical relationships between these variables. The visual aids, including the slide and handwritten notes, serve as primary references for the formulas and calculations presented.

Chapters

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

    The session begins with the instructor presenting a slide titled "Terminology" which lists five critical definitions essential for understanding process scheduling. He explains that Arrival Time (AT) is the specific moment a process enters the ready state, while Burst Time (BT) represents the total amount of CPU time required for a process to complete its execution. He further defines Completion Time (CT) as the time when the process finishes. Crucially, he writes out the formulas for Turn Around Time (TAT) as Completion Time minus Arrival Time, and Waiting Time as Turn Around Time minus Burst Time. To prepare for the example, he draws a table with columns for Process, AT, and BT, populating it with data for Process P1 (AT=0, BT=4) and Process P2 (AT=2, BT=6). The instructor gestures towards the slide to emphasize the definitions as he speaks.

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

    The instructor moves to the practical application phase by drawing a timeline on the right side of the screen to visualize the execution order. He explains that since P1 arrives at time 0, it is the first to execute. He marks the start of P1 at 0 and, given its burst time of 4, extends the block to time 4. He highlights that P2 arrives at time 2 but cannot start immediately because the CPU is occupied by P1. Consequently, P2 waits in the ready queue. Once P1 completes at time 4, P2 begins its execution. With a burst time of 6, P2 runs from time 4 to time 10. The instructor then updates the main table, filling in the Completion Time (CT) column, recording 4 for P1 and 10 for P2, establishing the finish times for both processes. He uses a pen to point at the timeline and the table simultaneously to connect the visual representation with the data.

  3. 5:00 – 8:45 05:00-08:45

    In the final segment, the instructor calculates the Turn Around Time (TAT) and Waiting Time (WT) for both processes using the formulas previously defined. He applies the formula TAT = CT - AT. For P1, he calculates 4 - 0 = 4. For P2, he calculates 10 - 2 = 8. He then uses the relationship TAT = Waiting Time + Burst Time to find the waiting time. For P1, the waiting time is 4 - 4 = 0, indicating it ran immediately without delay. For P2, the waiting time is 8 - 6 = 2, showing it waited for P1 to finish. He points to the slide to emphasize that Waiting Time is the difference between Turn Around Time and Burst Time. The video concludes with a fully populated table showing all calculated values, reinforcing the concepts of process scheduling efficiency and the impact of arrival times on waiting periods.

The video effectively bridges the gap between theoretical definitions and practical calculation in process scheduling. By starting with clear definitions on a slide and immediately applying them to a two-process example, the instructor creates a cohesive learning experience. The visual progression from a blank table to a filled timeline and finally to a complete data table helps students visualize the flow of time and resource allocation. The explicit calculation of waiting time highlights the cost of queuing, a key concept in operating systems. The instructor's methodical approach ensures that students can replicate the process for more complex scenarios involving multiple processes.

Loading lesson…