Reader Writer Problem

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/operating-systems/process-synchronization/classical-problems/asset-reader-writer-problem after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
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…