Two Process Solution Using Turn Variable

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-SENIOR-COMPUTER-INSTRUCTOR/operating-systems/process-synchronization/two-process-solutions/asset-two-process-solution-using-turn-variable after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
  10. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
  11. Paper-2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Distributed Systems
  12. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  13. Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  15. Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  16. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  17. Paper 2 | Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  18. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
  19. Paper 2 | Data Communication and Network Security: 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, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Ethical Hacking
  20. Paper-2 I Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  21. Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
  22. Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
  23. Pedagogy: Child Development, Concept of Pedagogy, Psychology, Theories, Inclusive Education, Experiential Pedagogy, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  24. Live Sessions: RSSB Live Sessions
  25. RSSB Paper 1 - Full Mock Tests:
  26. RSSB Paper 2 - Full Mock Tests:
  27. SCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video lecture, presented by Sanchit Jain Sir from Knowledge Gate, focuses on the 'Solutions to Critical Section Problem' in Operating Systems. The instructor systematically categorizes these solutions into four main types: Two Process Solution, Operating System Solution, Hardware Solution, and Computer and Programming Support Type. He details specific methods within each category, such as Peterson's Solution, Semaphores, and Monitors. The latter half of the lecture transitions into a deep dive into the 'Two Process Solution' using a Boolean variable named 'turn', analyzing the code structure for two processes (P0 and P1) and explaining the logic of mutual exclusion and strict alternation.

Chapters

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

    The video begins with a slide titled 'Solutions to Critical Section Problem'. The instructor introduces the four general categories of solutions. The first category is 'Two Process Solution', which includes 'Using Boolean variable turn', 'Using Boolean array flag', and 'Peterson's Solution'. He circles 'Peterson's Solution' to highlight it. The second category is 'Operating System Solution', listing 'Counting Semaphore' and 'Binary Semaphore'. The third is 'Hardware Solution', listing 'Test and Set Lock' and 'Disable interrupt'. The fourth is 'Computer and Programming Support Type', listing 'Monitors'. The instructor uses a pen to check off items as he introduces them, establishing the roadmap for the lecture.

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

    Continuing the overview, the instructor places checkmarks next to 'Counting Semaphore' and 'Binary Semaphore' under the Operating System Solution section. He then moves to the Hardware Solution, checking off 'Test and Set Lock' and 'Disable interrupt'. Finally, he checks 'Monitors' under the Computer and Programming Support Type. Throughout this segment, he gestures towards the screen, emphasizing that these are the standard approaches used to solve the critical section problem. The slide remains visible, providing a clear reference for the classification of synchronization mechanisms.

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

    The slide changes to a specific example titled 'Here we will use a Boolean variable turn, which is initialize randomly(0/1)'. A table displays code for two processes, P0 and P1. For P0, the code is `while (1) { while (turn!= 0); Critical Section turn = 1; Remainder section }`. For P1, it is `while (1) { while (turn!= 1); Critical Section turn = 0; Remainder Section }`. The instructor explains that the variable `turn` is initialized randomly to either 0 or 1. He writes 'turn = 0' or 'turn = 1' at the top of the table to illustrate the initialization state. He begins to explain the logic where P0 waits for `turn` to be 0 before entering the Critical Section.

  4. 10:00 – 13:22 10:00-13:22

    The instructor elaborates on the 'Boolean variable turn' solution. He draws arrows and circles to demonstrate the flow of execution. He explains that if `turn` is 0, P0 enters the Critical Section, executes its code, and then sets `turn = 1` before moving to the Remainder section. Conversely, P1 waits while `turn != 1`. He draws a loop for P1 indicating it waits until the condition is met. He highlights that this mechanism enforces strict alternation between the two processes. He points out that while this satisfies mutual exclusion, it may fail the progress requirement if a process is in the remainder section and the turn variable is not set correctly for it to enter again.

The lecture provides a structured overview of synchronization solutions, moving from a high-level classification to a specific algorithmic implementation. The instructor effectively uses visual aids like checkmarks and code snippets to categorize solutions into Two Process, OS, Hardware, and Programming types. The detailed analysis of the 'Boolean variable turn' solution demonstrates how strict alternation is achieved through a shared variable, serving as a foundational example for understanding more complex synchronization primitives like semaphores and monitors discussed in the initial overview.

Loading lesson…