No Pre-Emption
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Data Structures - Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Object Oriented Programming (OOPS), Programming in C++, Java, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends
- Artificial Intelligence: Artificial Intelligence
- Unit Test - Professional Knowledge:
- Full Length Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture focuses on the 'No pre-emption' condition in deadlock handling strategies within operating systems. The instructor, Sanchit Jain Sir, breaks down the specific rules governing resource allocation when pre-emption is not strictly forbidden but managed under certain conditions. He explains the step-by-step logic a system follows when a process requests resources: checking availability, checking if another waiting process holds them, and handling the waiting state. The lecture includes visual aids on the slide and hand-drawn diagrams to clarify the flow of resource pre-emption between processes.
Chapters
0:00 – 2:00 00:00-02:00
The instructor begins by analyzing the slide titled 'No pre-emption'. He reads the first bullet point: 'if a process requests some resources, we first check whether they are available. If they are, we allocate them.' He then moves to the second point, explaining that if resources are not available, the system checks if they are allocated to another process waiting for additional resources. If this condition is met, the system pre-empts the resources from the waiting process and allocates them to the requesting process. To illustrate this, he draws a diagram on the screen with 'R' representing a resource and 'P' representing a process, showing an arrow indicating the transfer of resources from one to the other.
2:00 – 3:18 02:00-03:18
The lecture proceeds to the third bullet point: 'If the resources are neither available nor held by a waiting process, the requesting process must wait.' The instructor emphasizes that while waiting, the process's own resources may be pre-empted if another process requests them. He then explains the final condition: a process can only be restarted when it is allocated the new resources it requested and recovers any resources that were pre-empted while it was waiting. He gestures to emphasize the recovery aspect of the process restart, ensuring the student understands that the process must regain its lost resources before continuing execution.
The video provides a detailed walkthrough of the 'No pre-emption' condition in deadlock handling. It clarifies that pre-emption is conditional. The system first checks availability. If unavailable, it looks for a waiting process holding the resource to pre-empt from. If no such process exists, the requester waits. During this wait, the requester is vulnerable to having its own resources taken by others. The process only resumes execution once it secures the requested resources and regains any previously held resources that were taken away. This structured approach ensures that resources are managed efficiently without causing indefinite blocking, balancing the needs of multiple processes in the system effectively.

