Practice Question

Duration: 17 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/operating-system/cpu-scheduling/priority-scheduling/asset-practice-question-3685 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. 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
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  13. 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
  14. 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, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. 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
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture is a practice question on CPU scheduling, specifically calculating the Average Turnaround Time (TAT) and Average Waiting Time (WT) using both Preemptive and Non-Preemptive Priority Scheduling. The instructor presents a table with four processes (P0 to P3) and their Arrival Times (AT), Burst Times (BT), and Priorities. The rule is that a lower priority number indicates a higher priority. The instructor first determines the execution order based on priority (P1, P3, P2, P0) and then constructs a Gantt chart for the Non-Preemptive case, showing process blocks P0, P1, P3, P2 with time marks 50, 70, 110, 210. He then transitions to the Preemptive case, where he updates the remaining burst times (e.g., 50→30, 20→0, 100→80) and constructs a new Gantt chart with boundary times 0, 30, 40, 60. Throughout the video, the instructor uses a whiteboard to draw the Gantt charts and a state diagram with 'Ready', 'Running', and 'Terminated' states to track the processes. The final timeline shows a Gantt chart with time marks 0, 20, 40, 60, 100, 180, 210, indicating the completion of the Preemptive scheduling calculation.

Chapters

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

    The instructor introduces the practice question: 'Calculate the Average Turnaround Time (TAT) and Average Waiting Time (WT) using both Preemptive and Non-Preemptive Priority Scheduling.' A table is displayed with columns for P. No, AT, BT, Priority, CT, TAT = CT - AT, and WT = TAT - BT. The AT column lists 50, 20, 100, 40 (later corrected to 0, 20, 40, 60) and the Priority column lists 4, 1(h), 3, 2. The instructor points to the priority column and writes the sequence P1, P3, P2, P0, indicating the order of execution based on priority, with a note that a lower priority number indicates a higher priority.

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

    The instructor begins the Non-Preemptive Priority Scheduling calculation. The table lists P0 (0, 50, 4), P1 (20, 20, 1(h)), P2 (40, 100, 3), P3 (60, 40, 2). He draws a green Gantt-style bar at the bottom, filling in P0 then P1 with time marks 50 and 70. He also sketches a diagram at the right showing 'Ready', 'Running', and 'Terminated' circles to track the state of the processes. The instructor points to the 'Non-Preemptive' label circled in pink, emphasizing the current method.

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

    The Non-Preemptive Gantt chart is completed, showing process blocks P0, P1, P3, P2 with time marks 50, 70, 110, 210. The instructor uses a pink pen to gesture toward the green rectangle outline below the table. He then sketches three green ovals on the right labeled 'Ready', 'Running', and 'Ternate' (Terminated), with arrows connecting them. In the 'Running' oval, 'P1' appears, while the 'Ready' oval shows 'P0' and 'P1' crossed out in pink, indicating the transition of processes between states.

  4. 10:00 – 15:00 10:00-15:00

    The instructor transitions to the Preemptive Priority Scheduling calculation. The whiteboard table shows several BT entries crossed out and rewritten (50→30, 20→0, 100→80), representing the remaining burst times. A Gantt chart at the bottom extends from 'P0 | P1' to 'P0 | P1 | P2 | P3', with boundary times 0, 30, 40, 60 marked beneath it. Green hand-drawn ovals on the right are labeled 'Ready', 'Running', and 'Rem Data', each containing process names such as P0, P1, P2, to track the preemptive state changes.

  5. 15:00 – 16:33 15:00-16:33

    The Preemptive Gantt chart is progressively filled with process labels P0, P1, P2, P3 and time marks 0, 20, 40, 60, 100, 180, 210. Green handwritten notes on the right group processes under 'Ready', 'Running', and 'Time/Date' with several entries crossed out in red. The instructor stands before the digital whiteboard, completing the visualization of the Preemptive scheduling timeline, which allows for the final calculation of TAT and WT for both methods.

The lecture focuses on solving a CPU scheduling problem involving Preemptive and Non-Preemptive Priority Scheduling. The key concepts include the definition of Turnaround Time (TAT = CT - AT) and Waiting Time (WT = TAT - BT), and the rule that a lower priority number signifies higher priority. The instructor demonstrates the step-by-step process of determining the execution order based on priority and arrival time. For the Non-Preemptive case, the Gantt chart is built by running each process to completion once it starts, resulting in a timeline of P0, P1, P3, P2. For the Preemptive case, the instructor updates the remaining burst times and adjusts the Gantt chart to reflect preemptions, resulting in a more complex timeline with multiple state transitions. The use of state diagrams ('Ready', 'Running', 'Terminated') helps visualize the movement of processes through the system. This practice question is designed to help students understand the differences between preemptive and non-preemptive scheduling and how to calculate performance metrics for each.

Loading lesson…