Basic 2PL
Duration: 8 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 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation 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 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 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and 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 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
- 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 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 | DataBase Management System/DBMS: 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 Database Recovery
- Paper 2 | Computer Networks: Introduction to CN 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture explains why basic locking protocols fail to ensure serializability and introduces the Two-Phase Locking (2PL) protocol as a solution. The instructor uses a schedule example to demonstrate non-serializable conflicts. He then defines the growing and shrinking phases of 2PL, emphasizing that lock acquisition must happen before lock release. Finally, he compares Basic 2PL with other protocols using a table, highlighting its strengths in serializability but weaknesses in recoverability and deadlock freedom.
Chapters
0:00 – 2:00 00:00-02:00
The instructor begins by analyzing a specific schedule involving two transactions, T1 and T2, displayed in a table. He explains that a basic lock-based protocol does not ensure serializability because the granting and releasing of locks do not follow a specific order. The table shows T1 performing LOCK-X(A), READ(A), WRITE(A), and UNLOCK(A), followed by T2 performing LOCK-S(B), READ(B), and UNLOCK(B). Later, T1 performs LOCK-X(B), READ(B), WRITE(B), and UNLOCK(B), while T2 performs LOCK-S(A), READ(A), and UNLOCK(A). The instructor draws red arrows to illustrate conflicts, specifically pointing out that T1 writes A before T2 reads it, and T2 reads B before T1 writes it. He concludes that this schedule is neither conflict serializable nor view serializable, highlighting the need for stricter rules. He emphasizes that even with locking, if the order is not managed, the system can end up in an inconsistent state.
2:00 – 5:00 02:00-05:00
The lecture transitions to the necessity of a locking protocol to prevent inconsistent states like dirty reads and poor concurrency. The instructor introduces the Two Phase Locking Protocol (2PL). The slide text defines the "Growing phase" as a period where a transaction may obtain locks but not release any. Conversely, the "Shrinking phase" is defined as a period where a transaction may release locks but may not obtain any new locks. The instructor draws a diagram resembling a mountain peak to visualize this. He marks the peak as the "Lock Point" (LP). The left side represents the growing phase where locks are acquired (e.g., A, B), and the right side represents the shrinking phase where locks are released. He emphasizes that once a transaction releases a lock, it enters the shrinking phase and cannot request new locks. The text on the slide explicitly states "The protocol ensures that each transaction issue lock and unlock requests in two phases".
5:00 – 7:35 05:00-07:35
The instructor presents a comparison table evaluating different protocols against properties like Conflict Serializability, View Serializability, Recoverability, Cascadelessness, and Deadlock Freedom. He specifically analyzes "Basic 2PL". He marks it with a checkmark for Conflict Serializability and View Serializability, indicating it ensures these properties. However, he marks it with a cross for Recoverability, Cascadelessness, and Deadlock Freedom, meaning Basic 2PL does not guarantee these. He then draws a vertical line diagram to further illustrate the phases. On the left of the line, he lists operations like X(A), R(A), W(A) representing the growing phase. On the right, he lists UNLOCK(A) representing the shrinking phase. This reinforces the rule that lock acquisition must precede lock release in a strict sequence. He also briefly shows rows for Time Stamp Ordering and Thomas Write Rule to contrast their properties.
The lesson progresses from identifying the limitations of arbitrary locking to defining the strict rules of 2PL. By visualizing the phases with diagrams and analyzing properties in a table, the instructor clarifies that while 2PL guarantees serializability, it introduces other challenges like potential deadlocks and cascading rollbacks, necessitating stricter variants like Strict 2PL for robust database systems.

