Race condition Example
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
- Artificial Intelligence: Artificial Intelligence
- Image Processing: Digital Image Fundamentals
- Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, 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, Cyber Safety and Security, Ethical Hacking
- Descriptive Paper: English Writing Ability
- Mains - Unit Tests:
- Mains - Full Mock Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This video solves a GATE-2015 operating-systems concurrency question. Two functions, P1 and P2, share a variable B with initial value 2. P1 executes C = B - 1; then B = 2 * C;, while P2 executes D = 2 * B; then B = D - 1;. The question asks for the number of distinct values that B can possibly take after execution. The instructor labels the four instructions I11, I12 for P1 and I21, I22 for P2. Because each function's two instructions must preserve their internal order, the possible interleavings are the six permutations of choosing which P1 instruction and which P2 instruction occur at each step. A table with Case 1 through Case 6 lists the six interleavings of I11, I12, I21, and I22. The instructor evaluates each case by tracking the shared variable B (and local variables C and D) through the sequence. For example, one interleaving gives I11: C = 2 - 1 = 1; then I21: D = 2 * 2 = 4; then I12: B = 2 * 1 = 2; then I22: B = 4 - 1 = 3. Other interleavings yield final values such as 2 and 3 (and in some orderings, other intermediate results). By circling the final B values across all six cases and removing duplicates, the instructor concludes that B can take 3 distinct final values. The answer '3' is circled at the bottom of the question slide.
Chapters
0:00 – 2:00 00:00-02:00
The slide presents the GATE-2015 question in an orange-and-white two-column table labeled P1() and P2(). The top line states that the two functions share a variable B with an initial value of 2 and execute concurrently. P1 contains 'C = B - 1;' then 'B = 2 * C;'; P2 contains 'D = 2 * B;' then 'B = D - 1;'. The red bottom line asks for the number of distinct values B can possibly take after execution. Handwritten blue annotations progressively label the P1 steps as I1, J1 and the P2 steps as I2, J2 (later refined to I11, I12 and I21, I22), establishing the instruction labels used for interleaving analysis.
2:00 – 3:58 02:00-03:58
The slide now shows two code blocks headed P1() and P2() with labeled instructions (I11) C = B - 1;, (I12) B = 2 * C; and (I21) D = 2 * B;, (I22) B = D - 1;. Below, a green-headed table lists six columns Case1 through Case6, each containing a vertical sequence of the four instruction labels in different orders. Blue vertical line marks highlight selected rows in Case1-Case4 as the instructor computes each interleaving. On-screen values such as C=1, D=4, B=2 appear during the step-by-step evaluation. The instructor circles key intermediate values (e.g., B=3) and crosses out redundant steps, then returns to the original question slide where the final answer '3' is circled at the bottom, indicating three distinct possible values for B.
The core teaching point is systematic enumeration of legal interleavings in a concurrent execution where each process's internal instruction order must be preserved. With two instructions per process, there are C(4,2) = 6 valid interleavings, which the instructor tabulates as Case1-Case6. The method is: (1) label each instruction, (2) list all order-preserving interleavings, (3) simulate the shared variable B through each sequence while tracking local variables C and D, (4) collect the final B values and count distinct ones. The worked example shows how one interleaving produces C=1, D=4, and a final B=3, while others produce different finals. The conclusion is that the number of distinct values B can take is 3, which is circled as the answer. This case-by-case table method is the key exam technique for GATE concurrency questions of this type.

