Round Robin Scheduling

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/operating-system/cpu-scheduling/round-robin-scheduling/asset-round-robin-scheduling after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Programming, Data Structures, OOP & Java: 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, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. Teaching Methodology: वृद्धि और विकास / Growth and Development, Concept of Pedagogy, विकास के सिद्धांत / Theories of Development, समावेशी शिक्षा / Inclusive Education, Experiential Pedagogy, आकलन और मूल्यांकन / Assessment and Evaluation, समाजीकरण और जेंडर / Socialisation and Gender, National Education Policy (NEP) 2020, संज्ञानात्मक प्रक्रियाएँ / Cognitive Processes, शिक्षण योजना और शिक्षण कौशल / Teaching Planning and Teaching Skills, Personality Development, शिक्षण विधियाँ / Teaching Methods, अधिगम और व्यवहारवादी सिद्धांत / Learning and Behavioural Theories, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, आकलन एवं मूल्यांकन / Assessment and Evaluation, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development
  5. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  6. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  7. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  8. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  9. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep, कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), कंप्यूटर नेटवर्क / Computer Networks, प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, प्रतिचयन / Sampling, प्रतिशत / Percentage, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, अनुपात और समानुपात / Ratio and Proportion
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: आँकड़ा निर्वचन / Data Interpretation
  18. Basis of Physics: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. Previous Year Paper:
  20. Business Studies and Management: Business Communication, प्रबंध के सिद्धांत एवं कार्य / Principles and Functions of Management, लेखांकन के आधार एवं लेन-देनों का अभिलेखन / Accounting Fundamentals and Recording of Transactions, Business Economics, ह्रास, अंतिम खाते व कंप्यूटरीकृत लेखांकन / Depreciation, Final Accounts and Computerised Accounting, Knowledge Management & New Economy
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video is an educational lecture on the Round Robin CPU scheduling algorithm presented by Sanchit Jain Sir from Knowledge Gate. The lesson begins with a conceptual introduction using a visual analogy of children playing on a merry-go-round to explain the cyclic nature of the algorithm. The instructor explains that Round Robin is specifically designed for time-sharing systems where responsiveness is prioritized over completing one process entirely before starting another. Key theoretical points include the treatment of the ready queue as a circular queue (FIFO) and the introduction of pre-emption to switch between processes. The lecture then transitions into a practical numerical problem involving six processes (P0 through P5) with specific arrival and burst times. The instructor sets a time quantum (TQ) of 2 units and demonstrates the scheduling sequence by drawing a Gantt chart. Finally, he calculates the Completion Time (CT), Turn Around Time (TAT), and Waiting Time (WT) for each process using the formulas TAT = CT - AT and WT = TAT - BT, filling out a detailed table to summarize the performance metrics.

Chapters

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

    The instructor introduces the Round Robin algorithm using a slide titled 'Round robin' featuring an image of children on a merry-go-round. He explains that this algorithm is designed for time-sharing systems where it is not necessary to complete one process before starting another, but rather to be responsive and divide CPU time among processes in the ready state. The slide text explicitly states that the ready queue is treated as a circular queue (FIFO). The instructor emphasizes the concept of fairness and responsiveness in this scheduling method, noting that it allows multiple processes to share the CPU effectively without waiting for a long process to finish.

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

    The slide displays bullet points detailing the mechanics of Round Robin. The instructor explains that the algorithm is similar to FCFS (First Come First Serve) scheduling but adds pre-emption to enable the system to switch between processes. He highlights that the ready queue is treated as a circular queue where the CPU scheduler goes around allocating the CPU to each process for a time interval equivalent to 1 Time quantum (TQ). The slide notes that the value of TQ can be anything, establishing the core parameter for the scheduling logic. He also mentions that if a process has a CPU burst less than the time quantum, it releases the CPU voluntarily, preventing unnecessary context switches.

  3. 5:00 – 10:00 05:00-10:00

    The instructor begins solving a numerical problem on a whiteboard. A table is shown with columns for P. No, Arrival Time (AT), and Burst Time (BT). The processes are P0 to P5 with arrival times 0, 1, 2, 3, 4, 6 and burst times 4, 5, 2, 1, 6, 3 respectively. He writes 'TQ = 2' on the board. He constructs a Gantt chart sequence: P0, P1, P2, P0, P3, P4, P1, P5, P4, P1. He marks the time points on the chart, showing the progression from time 0 to 21. The sequence shows how processes are interrupted and re-queued after their time quantum expires. He specifically writes the sequence P0 P1 P2 P0 P3 P4 P1 P5 P4 P1 on the board to visualize the execution order and timing.

  4. 10:00 – 12:00 10:00-12:00

    The instructor completes the table by filling in the Completion Time (CT), Turn Around Time (TAT), and Waiting Time (WT) columns. He calculates TAT using the formula TAT = CT - AT and WT using WT = TAT - BT. For example, for P0, CT is 8, so TAT is 8 - 0 = 8, and WT is 8 - 4 = 4. He points to the calculated values in the table, such as P1 having a TAT of 17 and WT of 12. The final table summarizes the performance of all processes under the Round Robin scheduling with a time quantum of 2. He also calculates the average waiting time at the bottom of the table, providing a final metric for system efficiency.

The video effectively bridges the gap between theoretical concepts and practical application of the Round Robin scheduling algorithm. By starting with a relatable analogy and moving to a step-by-step numerical solution, the instructor clarifies how time quantum affects process execution and waiting times. The detailed calculation of TAT and WT provides students with a clear method for evaluating scheduling efficiency in time-sharing systems. The use of a Gantt chart helps visualize the pre-emptive nature of the algorithm, showing exactly when processes are switched and how the circular queue operates in practice.

Loading lesson…