Multi Level Queue Scheduling

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/CDAC-C-CAT-COMPLETE-PREPARATION/section-b-os/cpu-scheduling/multilevel-queues/asset-multi-level-queue-scheduling after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
  2. Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
  3. Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
  4. Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
  5. Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
  6. Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
  7. Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
  8. Section B | Networking: 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
  9. Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
  10. Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  12. MOCK TEST:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed lecture on Multi Level-Queue Scheduling, a class of scheduling algorithms designed for situations where processes are easily classified into different groups. The instructor explains that a common division is made between foreground (interactive) processes and background (batch) processes, which have different response-time requirements and scheduling needs. The core concept involves partitioning the ready queue into several separate queues where processes are permanently assigned based on properties like memory size, process priority, or process type. The visual aid displays a hierarchy of queues, illustrating how the operating system manages these distinct groups to optimize system performance.

Chapters

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

    The instructor begins by presenting a slide titled Multi Level-Queue Scheduling which outlines the fundamental definition of the algorithm. He reads from the text stating that the algorithm partitions the ready queue into several separate queues. He emphasizes that processes are permanently assigned to one queue, generally based on some property of the process, such as memory size, process priority, or process type. The slide text explicitly mentions the division between foreground (interactive) and background (batch) processes, highlighting that these two types have different response-time requirements. The instructor uses this text to set the stage for understanding how different process types are handled differently by the OS. The text on the screen is clearly legible, providing a solid reference for the lecture content.

  2. 2:00 – 4:55 02:00-04:55

    The instructor actively annotates the diagram on the slide to demonstrate specific scheduling policies. He writes RR (Round Robin) next to the top two queues labeled system processes and interactive processes, indicating that these interactive tasks use time-slicing. Conversely, he writes FCFS (First Come First Serve) next to the bottom queue labeled batch processes, suggesting a non-preemptive approach for background tasks. He further clarifies the priority structure by writing 3(H) next to the top queue and 1(L) next to the bottom queue, explicitly marking the highest and lowest priorities. He circles the queues and writes numerical values like TN=3, =2, and =1 to represent the priority levels, visually reinforcing the concept that higher priority queues are serviced before lower priority ones. The handwritten notes provide a clear visual guide to the scheduling logic.

The lecture effectively bridges the gap between theoretical definitions and practical implementation. By starting with the general definition of partitioning queues and then moving to specific annotations like RR and FCFS, the instructor clarifies how different scheduling algorithms are applied to different process groups. The visual hierarchy of system processes at the top and batch processes at the bottom, coupled with priority markings, provides a clear mental model for students to understand how operating systems prioritize critical tasks over background jobs. This progression from text to diagram annotation helps solidify the concept of multilevel queue scheduling.

Loading lesson…