Ordering Among Different Process Using Semaphore
Duration: 8 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
- Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
- Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
- Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
- IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
- IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control 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
- IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
- IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
- IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
- IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
- IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
- IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
- IT Mains: Mobile App Development: Mobile Computing Multimedia
- IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video is an educational lecture on Operating Systems, specifically focusing on the synchronization concept of "Ordering" concurrent processes using semaphores. The instructor begins by introducing the topic and uses a relatable real-world analogy involving a street food vendor making a sandwich to illustrate the necessity of sequential steps. He then transitions to a formal problem statement requiring the execution order P2 -> P3 -> P1. The lecture concludes with a step-by-step derivation of the semaphore code needed to enforce this specific ordering constraint. The instructor uses a digital whiteboard to write down the semaphore variables and operations. This approach helps students understand the abstract concept through a concrete example.
Chapters
0:00 – 2:00 00:00-02:00
The session opens with the title "Ordering" clearly visible on the whiteboard. The instructor introduces the topic and immediately plays a video clip of a street food vendor preparing a sandwich. The vendor is shown cutting buns, spreading green chutney, and adding sliced tomatoes and onions. The instructor uses this visual to explain that just as ingredients must be added in a specific sequence to make the dish, processes in a computer system often need to execute in a defined order to function correctly. He points out that the vendor does not add the onion before the tomato, illustrating a strict ordering constraint. The video clip serves as a practical demonstration of the concept.
2:00 – 5:00 02:00-05:00
The instructor continues to reference the sandwich video, emphasizing the sequential dependency of the actions. He then shifts focus to the academic problem displayed on the screen: "Q Using Semaphores ensure that the order of execution of there concurrent process p1, p2 and p3 must be p2 -> p3 -> p1?". A table is presented with three columns labeled P1(), P2(), and P3(), representing the code blocks for each process. The instructor explains that the goal is to fill in the semaphore operations to enforce the specific chain of execution starting with P2. He notes that the processes are concurrent but must follow a specific path. The problem requires careful placement of wait and signal operations.
5:00 – 7:39 05:00-07:39
The instructor starts solving the problem by initializing two semaphores, writing `S1 = 0` and `S2 = 0` on the board. He explains that since P2 is the first process to run, it does not require a wait operation. He then places a `P(S1)` operation in the P3 column, indicating that P3 must wait for P2 to complete. He adds a `V(S1)` operation in the P2 column to signal P3. To handle the transition from P3 to P1, he adds a `P(S2)` operation in the P1 column and a `V(S2)` operation in the P3 column, effectively creating the chain P2 -> P3 -> P1. He writes the final code structure on the table, showing the P and V operations in their respective rows.
The lecture successfully connects a tangible real-world example with abstract computer science theory. By first visualizing the sequential steps of making a sandwich, the instructor clarifies the concept of process ordering. He then rigorously applies this logic to a standard Operating Systems problem, demonstrating the precise placement of P (wait) and V (signal) operations. The final solution shows how semaphores can be used to enforce a strict execution sequence of P2 -> P3 -> P1, ensuring that P3 waits for P2 and P1 waits for P3. This method ensures that the processes do not run in parallel but rather in a synchronized, ordered manner. The use of two semaphores allows for the chaining of three processes.

