Round Robin PQ
Duration: 13 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- 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
- 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
- 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
- Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- 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
- Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- Paper 2 | Cloud Technology: Cloud Computing
- Paper 2 | Probability and statistics: Probability, Statistics
- 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
- 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
- Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
- Full Length 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
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: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.
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.
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.

