Practice Question

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/operating-systems/process-management/process-state-lifecycle/asset-practice-question-3632 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 focuses on a classic Operating Systems problem involving process state management. The instructor presents a scenario where the total number of processes is fixed at 'n'. The objective is to calculate the minimum and maximum number of processes that can simultaneously exist in the Ready, Running, and Blocked states. The visual aid includes a process state transition diagram showing flows between New, Ready, Running, Waiting, and Terminated states. The instructor methodically fills a table to demonstrate the logical bounds for each state based on system architecture constraints. The diagram illustrates transitions like 'admitted' moving to Ready, 'scheduler dispatch' moving to Running, and 'I/O or event wait' moving to Waiting.

Chapters

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

    The session begins with the problem statement: determining min/max processes for Ready, Run, and Block states given 'n' total processes. The instructor starts with the 'Ready' row. He writes '0' in the Min column, noting that it is theoretically possible for no processes to be ready. In the Max column, he writes 'n-1'. He explains that since one process must be running to utilize the CPU, the maximum number of processes waiting in the ready queue is the total 'n' minus that one running process. He points to the diagram to show the flow from Ready to Running.

  2. 2:00 – 2:51 02:00-02:51

    The instructor proceeds to the 'Run' and 'Block' rows. For the 'Run' state, he writes '0' for the minimum, acknowledging that the CPU could be idle if all processes are blocked. For the maximum, he writes '1', clarifying that in a uniprocessor system, only a single process can execute at any given moment. Finally, for the 'Block' state, he writes '0' for the minimum and 'n' for the maximum. He explains that it is possible for all 'n' processes to be blocked simultaneously, waiting for I/O or events to complete, referencing the 'I/O or event wait' transition in the diagram.

The lecture effectively demonstrates how system constraints dictate process distribution. The 'Run' state is the most constrained, capped at 1 for uniprocessors. The 'Ready' state is capped at n-1 to ensure at least one process is available to run. The 'Block' state has the widest range, from 0 to n, depending on I/O wait times. This analysis helps students understand the dynamic nature of process scheduling and resource allocation in operating systems. The instructor uses the state transition diagram to ground these abstract numbers in concrete system behaviors. Understanding these limits is crucial for designing efficient schedulers that prevent deadlock or starvation.

Loading lesson…