Criterion to Solve Critical Section Problem
Duration: 10 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
- Paper 2 | Computer Networks: Introduction to CN 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture provides a comprehensive explanation of the three fundamental criteria required to solve the Critical Section Problem in operating systems. Presented by Sanchit Jain Sir from Knowledge Gate Educator, the session begins by defining Mutual Exclusion, ensuring that only one process can access the critical section at any given instant to prevent data inconsistency. The lecture then transitions to the concept of Progress, which dictates that if no process is in the critical section, a decision must be made promptly regarding which waiting process enters next, without interference from processes in their remainder sections. Finally, the instructor covers Bounded Waiting, which establishes a limit on how many times other processes can enter the critical section before a waiting process is granted access, thereby preventing indefinite waiting or starvation. The session concludes with a summary slide emphasizing that Mutual Exclusion and Progress are mandatory requirements for a valid solution, while Bounded Waiting is an optional criterion that, if ignored, leads to starvation. The instructor uses clear on-screen text definitions and hand-drawn diagrams to make abstract concepts concrete.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the first criterion, "Mutual Exclusion," which is displayed prominently on the slide with the text: "No two processes should be present inside the critical section at the same time, i.e. only one process is allowed in the critical section at an instant of time." To visualize this, the instructor draws a square box on the whiteboard labeled "CS" (Critical Section). He then draws two arrows labeled "P1" and "P2" pointing towards the box, illustrating that while multiple processes may request entry, the system must enforce a rule where only one process, such as P1, can actually be inside the CS while P2 waits outside. He underlines the term "Mutual Exclusion" on the slide to emphasize its importance. This visual aid reinforces the core concept of exclusive access to shared resources, ensuring that concurrent processes do not interfere with each other's execution within the critical section. The instructor's gestures and the clear text on the slide make the definition easy to understand for students.
2:00 – 5:00 02:00-05:00
The lecture moves to the second criterion, "Progress." The slide text explains: "If no process is executing in its critical section and some processes wish to enter their critical sections, then only those processes that are not executing in their remainder sections can participate in deciding which will enter its critical section next." The instructor writes "P1 P2 ... P4000" on the board to represent a scenario with a large number of processes waiting to enter. He draws a circle around these processes to symbolize the decision-making mechanism. He emphasizes that processes currently in their remainder sections (not interested in entering) should not block the decision-making process for those who are waiting. This ensures that the system makes progress and doesn't get stuck in a state where no one enters the critical section despite requests. He underlines "Progress" and "wish to enter" on the slide to highlight key conditions. The notation "P4000" specifically illustrates a high-concurrency scenario where efficient decision-making is crucial.
5:00 – 9:52 05:00-09:52
The final criterion discussed is "Bounded Waiting." The slide states: "There exists a bound or a limit on the number of times a process is allowed to enter its critical section and no process should wait indefinitely to enter the CS." The instructor draws a diagram showing processes P1, P2, and P3 waiting in a queue for the CS. He explains that without a bound, a process could wait forever if others keep entering. The video concludes with a slide titled "Some Points to Remember," which underlines that "Mutual Exclusion and Progress are mandatory requirements" for a valid solution. It further clarifies that "Bounded waiting is optional criteria," noting that if it is not satisfied, it may lead to "starvation." This final summary helps students distinguish between essential and desirable properties of critical section solutions, a key distinction for exam questions. The instructor explicitly underlines "starvation" to warn students about the consequences of ignoring this criterion.
The video systematically breaks down the theoretical requirements for solving the Critical Section Problem. It starts with the fundamental necessity of Mutual Exclusion to prevent race conditions, moves to Progress to ensure system liveness, and concludes with Bounded Waiting to guarantee fairness. The instructor uses clear on-screen text definitions and hand-drawn diagrams to make abstract concepts concrete. The final summary slide serves as a crucial revision point, highlighting the distinction between mandatory and optional criteria, which is a common topic in operating systems examinations.

