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
- 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.
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.

