Understanding Semaphore
Duration: 8 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 educational video provides a comprehensive lecture on Operating Systems, specifically focusing on Semaphores as synchronization tools designed for n-process solutions. The instructor begins by defining a semaphore S as a simple integer variable that, apart from initialization, can be accessed only through two standard atomic operations: wait(S) and signal(S). He provides historical context, noting that the wait(S) operation was originally termed P(S) and signal(S) was originally called V(S). The core of the lecture involves a detailed dissection of the implementation of these operations. The instructor displays code blocks for both Wait(S) and Signal(S) on a slide titled "Operation System Solution". He explains that Wait(S) involves a while loop checking if S is less than or equal to zero, followed by a decrement operation. Conversely, Signal(S) involves an increment operation. Throughout the session, the instructor uses the whiteboard area to write initialization values like `int S = 1` to demonstrate mutex behavior and `int S = 10` to illustrate counting semaphores, emphasizing the atomic nature of these critical section protections and how they manage resource access in a concurrent environment. The slide also includes the text "The definition of wait () is as follows", guiding the student to the code implementation.
Chapters
0:00 – 2:00 00:00-02:00
The lecture opens with a slide titled "Operation System Solution" listing key properties of semaphores. The text explicitly states, "Semaphores are synchronization tools using which we will attempt n-process solution." It further defines S as a "simple integer variable that, but apart from initialization it can be accessed only through two standard atomic operations: wait(S) and signal(S)." The instructor highlights that wait(S) was originally termed P(S) and signal(S) was originally called V(S). He introduces the definition of wait() by pointing to the code block on the left side of the screen, setting the stage for a code-level explanation of synchronization primitives. The slide also mentions that the definition of wait() is as follows, leading into the code blocks. The "KG" logo is visible in the top right corner.
2:00 – 5:00 02:00-05:00
The instructor focuses on the `Wait(S)` function implementation. He writes `int S = 1` on the screen to demonstrate a specific initialization case, likely for a mutex. The slide shows the `Wait(S)` code structure: a `while(s<=0);` loop followed by `s--;`. He explains that if the semaphore value is zero or negative, the process waits. He writes `P(S)` next to the `Wait(S)` header to reinforce the original terminology. The visual focus remains on the left code block, detailing the logic where a process decrements the semaphore only if it is positive, otherwise it spins or blocks. He points specifically to the `while(s<=0);` line to emphasize the waiting condition. The code block is enclosed in curly braces `{ }`.
5:00 – 8:17 05:00-08:17
The explanation shifts to the `Signal(S)` operation and further elaboration on initialization. The instructor points to the `Signal(S)` code block on the right, which contains `s++;`. He writes `int S = 10` on the board to explain a counting semaphore scenario where multiple resources are available. He contrasts the decrement in Wait(S) with the increment in Signal(S). He gestures towards the `while(s<=0);` line in the Wait block, emphasizing the condition that causes a process to wait. The lecture concludes this segment by reinforcing that these operations must be atomic to prevent race conditions, visually linking the code snippets to the theoretical definitions provided at the start. He also writes `V(S)` next to Signal(S). The code block for Signal(S) is also enclosed in curly braces `{ }`.
The video effectively bridges the gap between theoretical definitions and practical code implementation for semaphores. By starting with the slide definitions of atomic operations and then moving to the specific C-like syntax of `Wait(S)` and `Signal(S)`, the instructor clarifies how synchronization is achieved. The use of handwritten notes like `int S = 1` and `int S = 10` provides concrete examples of how initialization values dictate the behavior of the semaphore, distinguishing between binary semaphores (mutexes) and counting semaphores. The visual progression from the slide text to the handwritten code annotations helps students understand the transition from abstract concepts to executable logic. The instructor's gestures and writing on the screen serve as key visual aids for understanding the flow of control in semaphore operations.

