Reader Writer Problem Solution using semaphore
Duration: 12 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.
The video provides a detailed lecture on solving the Readers-Writers synchronization problem using semaphores. The instructor defines shared variables (mutex, wrt, readcount) and constructs the logic for Writer and Reader processes. He explains the necessity of protecting the readcount variable with a mutex and using the wrt semaphore to block writers when readers are active. The lecture culminates in a complete code structure that implements a readers-preference solution, ensuring writers wait if readers are present.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with the instructor introducing the 'Solution using Semaphores' for the Readers-Writers problem. On the slide, he lists the shared data structures: semaphore mutex = 1, semaphore wrt = 1, and int readcount = 0. He explains that these variables are shared among all reader processes. He clarifies the role of mutex as a binary semaphore used to protect the readcount variable from race conditions, ensuring that only one process updates the count at a time. He also defines wrt as a semaphore used to manage access to the shared resource, specifically to block writers when readers are active. He points to the text on the screen to emphasize the initialization values.
2:00 – 5:00 02:00-05:00
The instructor moves to the whiteboard to outline the logic for the Writer process. He writes Wait(wrt) before the Critical Section (CS) for writing and Signal(wrt) after. He explains that this simple structure ensures that only one writer can access the resource at a time and that writers are blocked if readers are currently reading. He then shifts focus to the Reader process, writing Readcount++ to increment the count when a reader enters and Readcount-- when it leaves. He emphasizes that these operations must be atomic to prevent data corruption and that a separate mechanism is needed to protect the counter.
5:00 – 10:00 05:00-10:00
The instructor refines the Reader process logic by adding synchronization primitives. He writes Wait(mutex) before Readcount++ and Signal(mutex) after, ensuring the counter update is safe. He then introduces the critical logic for the first and last readers. He writes If(readcount == 1) followed by wait(wrt), explaining that the first reader must block writers. Conversely, he writes If(readcount == 0) followed by signal(wrt), explaining that the last reader must release the resource for waiting writers. He draws arrows to show the flow of execution and the conditions under which writers are blocked or unblocked. He also writes R1 and R2 to denote different readers.
10:00 – 12:11 10:00-12:11
The instructor completes the solution by filling in the full table for both Writer and Reader processes. He writes the complete code sequence: Writer waits on wrt, enters CS, signals wrt. Reader waits on mutex, increments readcount, checks if it is the first reader (waits on wrt), signals mutex, enters CS, waits on mutex, decrements readcount, checks if it is the last reader (signals wrt), and signals mutex. He reviews the entire flow, pointing out how the wrt semaphore acts as a gatekeeper for writers, ensuring they wait if any readers are present, thus implementing a readers-preference solution. He highlights the specific lines of code on the board to reinforce the logic.
The lecture systematically builds a solution to the Readers-Writers problem. It starts with defining shared resources, then constructs the Writer process to ensure exclusive access. It then develops the Reader process, introducing a counter (readcount) protected by a mutex. The core logic involves the first reader blocking writers and the last reader releasing them. The final output is a complete, synchronized code structure that prioritizes readers.

