Longest common Subsequence Part-2
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: 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
- 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
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- 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, Complexity Theory
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video provides a comprehensive lecture on the Longest Common Subsequence (LCS) problem using dynamic programming. It begins with a concrete example involving two strings, X and Y, demonstrating the construction of a DP table to find the LCS length. It then transitions to the theoretical foundation, defining the problem formally with sequence notation. The lecture details the "Optimal Substructure" property, explaining how the solution depends on smaller subproblems based on character matches. Finally, it presents the recursive solution formula and the corresponding pseudocode algorithm for computing the LCS length and reconstructing the sequence. This structured approach moves from practical application to theoretical understanding and finally to algorithmic implementation.
Chapters
0:00 – 2:00 00:00-02:00
The instructor begins with a concrete problem statement: "Consider two strings X = 'A, B, C, B, D, A, B' and Y = 'B, D, C, A, B, A'. Find the longest common subsequence." He displays a large dynamic programming grid with rows labeled 0 to 7 and columns 0 to 6. The grid is filled with red numbers and arrows. He circles the characters in the strings at the top and left. He traces a path through the table using blue arrows, indicating the backtracking process to reconstruct the subsequence. The number "4" is written at the top right, representing the final length of the LCS. This section serves as a practical demonstration of the algorithm's output before diving into the theory.
2:00 – 5:00 02:00-05:00
The lecture transitions to the theoretical foundation with a slide titled "Longest common subsequence." It defines two sequences $X_m = \{x_1, x_2, ..., x_m\}$ and $Y_n = \{y_1, y_2, ..., y_n\}$ and states the goal is to find the maximum length common sequence $Z = \{z_1, z_2, ..., z_k\}$. The instructor underlines the sequence notation and circles the variables X and Y. He then introduces "STEP 1: Optimal Substructure," which breaks down the problem into three cases. The first case states if $x_m = y_n$, then $z_k = x_m = y_n$ and $Z_{k-1}$ is an LCS of $X_{m-1}$ and $Y_{n-1}$. The other cases handle when characters do not match. He draws diagrams on the right to visualize these relationships, circling $X_{m-1}$ and $Y_n$ to show how the subproblem shrinks.
5:00 – 7:03 05:00-07:03
The final section covers "STEP 2: Recursive Solution" and "STEP 3: Computing the length of L.C.S". The slide defines $C[i, j]$ as the length of the LCS of $X_i$ and $Y_j$. It presents the recursive formula: $C[i, j] = 0$ if $i=0$ or $j=0$; $C[i, j] = C[i-1, j-1] + 1$ if $x_i = y_j$; and $C[i, j] = \max(C[i, j-1], C[i-1, j])$ if $x_i eq y_j$. The instructor draws a small grid to explain the indices $i, j$ and their neighbors. The last slide shows pseudocode for `LCS-Length(x, y)`, detailing the initialization of $m$ and $n$, the loops to set the first row/column to 0, and the nested loop logic. It specifies updating `c[i, j]` and `b[i, j]` with edge directions like 'D_edge', 'V_edge', and 'H_edge'. The video ends by showing the filled table again.
The video effectively bridges the gap between a concrete example and abstract algorithmic theory. It starts by showing the "what" (the result on a specific grid), moves to the "why" (optimal substructure and mathematical definitions), and finishes with the "how" (recursive formulas and pseudocode). This progression helps students understand not just how to apply the algorithm, but the underlying logic that makes it work. The visual aids, such as the filled grid and the drawn diagrams, are crucial for understanding the index dependencies and the backtracking process required to find the actual subsequence, not just its length.

