Round Robin PQ

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-2-operating-systems/cpu-scheduling/round-robin-scheduling/asset-round-robin-pq after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: UPPSC Course Overview
  2. Interview Preparation & Guidance: Interview Preparation
  3. Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material)
  4. Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
  5. Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  6. Paper 1 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, ORDBMS, NoSQL
  7. Paper 1 | Cyber Security: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking
  8. Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
  9. Paper 1 | Computer Networks: Introduction to CN, Data Communication, 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, Network Security
  10. Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  11. Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  12. Paper 1 | Discrete Structures and Theory of Logic: Permutation and Combination, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  13. Paper 1 | Software Project Management: Software Project Management
  14. Paper 2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  15. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  16. Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, Emerging Tech Trends
  17. Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
  18. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  19. Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  20. Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
  21. Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
  22. Paper 2 | Distributed System: Distributed Systems
  23. UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
  24. Previous Year Papers:
  25. Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video demonstrates a Round Robin scheduling practice problem. The instructor sets up a table for six processes (P0-P5) with arrival and burst times, then constructs a Gantt chart using a time quantum of 3 units. A queue box tracks the ready processes as they are scheduled. The instructor calculates completion times, turnaround times, and waiting times for each process, ultimately deriving the average turnaround time and average waiting time. The solution involves tracking process execution across multiple time slices and managing the ready queue as new processes arrive and others complete.

Chapters

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

    The instructor introduces the problem: calculating average TAT and WT using Round Robin with a time quantum of 3 units. A table is set up with columns for P. No, Arrival Time (AT), Burst Time (BT), Completion Time (CT), TAT = CT - AT, and WT = TAT - BT. The arrival times are filled in as 5, 4, 3, 1, 2, 6 for P0 through P5, and burst times are listed as 5, 6, 7, 9, 2, 3. The instructor begins sketching a Gantt chart, starting with an idle region from 0 to 1, then scheduling P3 first since it has the earliest arrival time.

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

    The Gantt chart expands to show P3 executing from 1 to 4, followed by P4 from 4 to 6, P0 from 6 to 9, and P1 from 9 to 12. A pink Queue box on the right tracks the ready processes, initially showing P4, P0, P3, P5, then adding P2 and another P4 as processes arrive and wait. The instructor explains how processes are added to the queue upon arrival and how the quantum of 3 units determines when a process is preempted and sent to the back of the queue.

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

    The Gantt chart continues with P3 resuming from 12 to 15, then P0 from 15 to 18, P5 from 18 to 21, and P0 again from 21 to 24. The queue box updates to reflect the changing ready state, showing sequences like P1, P5, P3, P2, P4 shifting to longer sequences including P0 and P1. The instructor fills in the Burst Time column with values 8, 3, 4, 3, 2, 3 in pink and green ink, while the AT column remains 5, 4, 3, 1, 2, 6. The process of tracking remaining burst times and re-queuing preempted processes is emphasized.

  4. 10:00 – 13:20 10:00-13:20

    The instructor completes the table by filling in the CT column with values 32, 27, 30, 30, 06, 01, then calculates TAT as 27, 23, 27, 29, 04, 15, and WT as 22, 17, 23, 20, 02, 12. The final Gantt chart shows the complete execution sequence with time markers up to 33. The instructor computes the averages, showing 76/6 = 12.8 for average TAT and 96/6 for average WT. The queue box displays the final sequence P1 P0 P1 P3 P0 P5 P0 P1 P3 P0 P5, illustrating the full scheduling order.

This lecture provides a step-by-step worked example of Round Robin scheduling. The key concepts include: (1) setting up a process table with arrival and burst times, (2) constructing a Gantt chart that respects the time quantum, (3) maintaining a ready queue that updates as processes arrive and are preempted, and (4) calculating completion, turnaround, and waiting times. The method emphasizes that when a process's quantum expires, it is sent to the back of the queue with its remaining burst time. New arrivals are added to the queue in order of arrival. The final metrics are derived by summing individual TAT and WT values and dividing by the number of processes. The example demonstrates how to handle multiple preemptions and arrivals within a single scheduling problem.

Loading lesson…