System Queues

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/operating-systems/process-management/process-state-lifecycle/asset-system-queues after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: 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, Data Warehousing & Mining, Big Data Systems, NoSQL
  15. Operating Systems: 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
  16. 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture begins by defining the core objectives of process management, specifically distinguishing between multiprogramming and time sharing to optimize system performance. It then transitions to a detailed explanation of scheduling queues, utilizing diagrams to illustrate how processes are organized in memory using linked lists. Finally, the session concludes with a comprehensive queueing diagram that maps out the lifecycle of a process, including transitions to the CPU, I/O operations, and interrupt handling.

Chapters

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

    The instructor introduces the fundamental goals of process management. The slide displays text stating, "The objective of multiprogramming is to have some process running at all times, to maximize CPU utilization." He further explains that "The objective of time sharing is to switch the CPU among processes so frequently that users can interact with each program while it is running." He emphasizes that a process scheduler selects an available process for execution, noting that in a single-processor system, there is never more than one running process at a time. The text explicitly states, "To meet these objectives, the process scheduler selects an available process (possibly from a set of several available processes) for execution on the CPU."

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

    The topic shifts to "Scheduling Queues." The slide text explains that processes entering the system are placed in a "job queue," while those ready to execute reside in a "ready queue." The instructor points to a diagram showing a linked list structure where a "queue header" contains pointers to the "head" and "tail." He highlights that each Process Control Block (PCB) includes a pointer to the next PCB. The diagram also visualizes device queues for resources like "mag tape unit 0" and "disk unit 0," illustrating how processes wait for specific hardware. The text notes, "A ready-queue header contains pointers to the first and final PCBs in the list."

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

    The final segment presents a "Queueing-diagram representation of process scheduling." The slide text clarifies that rectangular boxes represent queues, such as the "ready queue" and device queues, while circles represent resources like the "CPU." The instructor actively annotates the diagram, drawing an arrow labeled "exit" from the CPU to show process termination. He also draws a curved arrow from the "I/O" circle back to the "ready queue," demonstrating how a process returns to the ready state after an I/O operation completes. Other boxes in the diagram include "time slice expired," "fork a child," and "wait for an interrupt," showing various state transitions.

The lecture effectively bridges theoretical objectives with practical implementation details. It moves from high-level goals like CPU utilization to the data structures (linked lists) used to manage processes, and finally to the dynamic state transitions depicted in the queueing diagram. This progression helps students understand not just why scheduling happens, but how it is structurally and logically managed within an operating system.

Loading lesson…