Circular Wait
Duration: 6 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-2 | Programming & 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 | Databases / DBMS & SQL: 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
- Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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 | 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 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- 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-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
- Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This video is a lecture on the topic of 'Circular wait', a condition in operating systems that can lead to deadlock. The instructor, Sanchit Jain, explains a method to eliminate the circular wait condition by enforcing a strict ordering on resource requests. The core concept is to assign a natural number to each resource and require all processes to request resources in increasing order of their numbers. If a process needs a resource with a lower number than one it already holds, it must first release all resources with higher numbers before making a new request. The lecture uses a whiteboard to illustrate this with diagrams showing processes (P1, P2) and resources (R1, R2), first depicting a scenario where circular wait can occur and then showing how the ordering rule prevents it. The video is part of a series by Knowledge Gate Educator.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a slide titled 'Circular wait' which presents a text-based solution to eliminate the circular wait problem. The text states: 'We can eliminate circular wait problem by giving a natural number mapping to every resource and then any process can request only in the increasing release order and if a process wants a lower number, then process must first release all the resource larger than that number and then give a fresh request.' The instructor, Sanchit Jain, begins to explain this concept, writing 'P1' and 'P2' on the whiteboard to represent processes, and 'R1' and 'R2' to represent resources, setting up the context for a diagrammatic explanation.
2:00 – 5:00 02:00-05:00
The instructor draws a diagram to illustrate the circular wait condition. On the left side of the whiteboard, he draws a process P1 requesting resource R1, and a process P2 requesting resource R2. He then draws arrows to show that P1 is holding R1 and waiting for R2, while P2 is holding R2 and waiting for R1, creating a circular dependency. He explains that this is a classic example of a deadlock. He then draws a vertical line to separate this scenario from the solution, and on the right side, he begins to draw a new diagram to show how the problem is solved by enforcing a resource ordering.
5:00 – 6:06 05:00-06:06
The instructor completes the diagram on the right side of the whiteboard to demonstrate the solution. He shows that if processes must request resources in increasing order, then P1 can only request R1 before R2. He draws a diagram where P1 requests R1, then R2, and P2 requests R2, then R1. He explains that this ordering prevents the circular wait because a process cannot hold a higher-numbered resource and then request a lower-numbered one. He also draws a circle around the resources R1 and R2 to emphasize the concept of a resource hierarchy. The video ends with the instructor summarizing the method.
The video provides a clear, step-by-step explanation of how to prevent the circular wait condition, a necessary condition for deadlock. It starts by defining the problem with a textual rule and then uses a visual, diagrammatic approach to contrast a problematic scenario with a solution. The core teaching point is the enforcement of a total ordering on resource requests, which breaks the circular dependency. The instructor effectively uses the whiteboard to build the concept from a simple definition to a complex, illustrative diagram, making the abstract concept of deadlock prevention more concrete for the viewer.

