Round Robin PQ

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/WIPRO-PREPARATION/operating-systems/cpu-scheduling/round-robin-scheduling/asset-round-robin-pq after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Number System, Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Mixture and Alligation, Data Interpretation, Permutation and Combination, Probability, Logarithm, Powers and Exponents (Surds and Indices), Age Problems, Divisibility Rules, Partnership, HCF LCM, Algebra, Pipe and Cistern
  2. Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Analogy, Coding Decoding, Blood Relations, Directions (Direction Test), Syllogisms, Logical Sequence Of Words, Data Sufficiency, Seating Arrangements, Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement
  3. English Language: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Cloze Test (Cloze Passage), Tenses, Subject Verb Agreement (Verb Noun Agreement), Preposition, Articles, Conjunction, Adverb
  4. Written English Test: English Writing Ability
  5. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  6. Communication Round: Communication Assessment
  7. DBMS (Technical Interview): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Big Data Systems, NoSQL, Data Warehousing & Mining
  8. SQL (Technical Interview): SQL
  9. Operating Systems (Technical Interview): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  10. Computer Networks (Technical Interview): 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  11. OOPs (Technical Interview): Object Oriented Programming (OOPS)
  12. HR Interview: MR & HR Interview Preparation
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…