Reader Writer Problem

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-2-operating-systems/process-synchronization/classical-problems/asset-reader-writer-problem after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: UPPSC Course Overview
  2. Interview Preparation & Guidance: Interview Preparation
  3. Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material)
  4. Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
  5. Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  6. Paper 1 | Database Management Systems: 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, ORDBMS, NoSQL
  7. Paper 1 | Cyber Security: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking
  8. Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
  9. Paper 1 | Computer Networks: 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
  10. Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  11. Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  12. Paper 1 | Discrete Structures and Theory of Logic: Permutation and Combination, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  13. Paper 1 | Software Project Management: Software Project Management
  14. Paper 2 | Operating Systems: 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, Security
  15. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  16. Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, Emerging Tech Trends
  17. Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
  18. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  19. Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  20. Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
  21. Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
  22. Paper 2 | Distributed System: Distributed Systems
  23. UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
  24. Previous Year Papers:
  25. Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture introduces the classic Reader-Writer problem in the context of operating systems and concurrent processes. The instructor sets up a scenario where a database is shared among several processes. He distinguishes between 'readers,' which only read data, and 'writers,' which perform both read and write operations. The central challenge is managing concurrent access to prevent data inconsistency. The instructor explains that while multiple readers can access the shared data simultaneously without adverse effects, any interaction involving a writer (Reader-Writer, Writer-Reader, or Writer-Writer) can lead to 'chaos' or data corruption. Consequently, the lecture outlines the fundamental constraints required to generate a valid solution for this synchronization problem. The instructor uses a database table example to visualize the data being shared.

Chapters

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

    The instructor begins by defining the problem using a visual example of a database table containing movie titles and release years. He explains that some processes are readers (read-only) and others are writers (read/write). He states that if two readers access the shared data simultaneously, no adverse effects result. However, if a writer and another process access the database simultaneously, chaos may ensue. To illustrate permissible concurrency, he writes 'RR' on the whiteboard, indicating that Reader-Reader access is allowed. The visible database shows columns like 'title', 'release_year', 'length', and 'replacement_cost'. The slide text reads 'Suppose that a database is to be shared among several concurrent processes.' He gestures with his hands to emphasize the concept of sharing.

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

    The instructor continues by illustrating the problematic concurrency scenarios. He writes 'RW', 'WR', and 'WW' on the board, circling them to show that any combination involving a writer causes issues. He then transitions to a slide titled 'Points that needs to be taken care for generating a Solutions'. He reads and explains the first point: the solution may allow more than one reader at a time, but should not allow any writer. He underlines this text to emphasize the priority of allowing concurrent readers. The slide also states, 'To ensure that these difficulties do not arise, we require that the writers have exclusive access to the shared database while writing to the database.' He points to the text to guide the viewer's attention.

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

    The instructor focuses on the second constraint listed on the slide. He explains that the solution must strictly not allow any reader or writer while a writer is performing a write operation. He underlines 'write operation' and 'exclusive access' to highlight the critical nature of writer exclusivity. The slide text is clearly visible, providing the formal requirements for the synchronization algorithm that will likely be discussed next. He gestures towards the text to reinforce the point. The text 'The solution should strictly not allow any reader or writer, while a writer is performing a write operation' is highlighted.

The lecture progresses from defining the Reader-Writer problem and its constraints to outlining the specific requirements for a solution. It establishes that while readers can share data, writers require exclusive access to prevent data corruption. The instructor uses visual aids like a database table and whiteboard annotations to clarify the concepts of concurrent access and the resulting conflicts.

Loading lesson…