Types of Semaphores

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/operating-system/process-synchronization/types-of-semaphores/asset-types-of-semaphores after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed lecture on the implementation of semaphores in operating systems, specifically focusing on the "Modified Wait" and "Modified Signal" operations designed to eliminate busy waiting. The instructor, Sanchit Jain, begins by introducing the topic and setting up a conceptual framework involving multiple processes. The core of the lesson transitions into a slide-based explanation of how to modify standard semaphore definitions. The lecture details the logic where a process executing a wait operation blocks itself rather than looping if the resource is unavailable. It further explains the corresponding signal operation that wakes up blocked processes. The instructor uses whiteboard diagrams to visualize the state of the semaphore value and the waiting queues, demonstrating how the value changes from positive to negative as processes wait and back towards zero as they are signaled. This approach ensures efficient CPU usage by preventing processes from consuming cycles while waiting for resources.

Chapters

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

    The video opens with a title slide reading "Types of Semaphore" and identifying the instructor as "SANCHIT JAIN SIR" from "KNOWLEDGE GATE EDUCATOR". The lecturer begins drawing on a digital whiteboard to illustrate a scenario. He writes the labels P1, P2, P3 and draws a horizontal line, eventually labeling the end of the line P100. He performs a calculation on the board, writing 1/10 x 10 = 1, which appears to be a preliminary example or a setup for a probability problem related to the semaphore context. This initial segment sets the stage for discussing how processes interact with shared resources.

  2. 2:00 – 5:00 02:00-05:00

    The presentation moves to a slide titled "Modified Wait". The text explains that to overcome busy waiting, the wait() operation is modified so that if the semaphore value is not greater than zero, the process blocks itself. The code snippet wait(semaphore *S) is displayed, showing the logic: S->value-- followed by an if statement checking if S->value < 0. If true, the process is added to S->list and block() is called. The instructor draws a diagram showing processes P1, P2, P3 queuing up. He writes S = -3 to indicate that three processes are currently waiting in the blocked state, illustrating the concept of a negative semaphore value representing the number of waiting processes.

  3. 5:00 – 7:39 05:00-07:39

    The final section covers "Modified Signal". The slide text states that a blocked process should be restarted when another process executes a signal() operation. The code Signal(semaphore *S) is shown, which increments S->value++. If the new value is less than or equal to zero, a process P is removed from S->list and wakeup(P) is called. The instructor draws a diagram showing the semaphore value changing from S = -2 to -1 and finally to 0. He illustrates how processes P2, P3, P4 are removed from the waiting list and moved to the ready state, effectively demonstrating the mechanism of releasing resources and waking up waiting threads.

The lecture effectively bridges the gap between theoretical semaphore definitions and practical implementation by addressing the inefficiency of busy waiting. By modifying the wait and signal operations to include blocking and waking mechanisms, the system ensures that CPU time is not wasted on processes that cannot proceed. The visual progression from a simple calculation to complex queue management and state changes in the semaphore value provides a clear, step-by-step understanding of how operating systems manage concurrent access to shared resources. This method is crucial for maintaining system stability and performance in multi-threaded environments.

Loading lesson…