Recurrence Relation - 5

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/algorithms/time-complexity-analysis/recursion-tree-method/asset-recurrence-relation-5-20115 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. 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)
  13. 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, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment demonstrates the application of the recursion tree method to determine the time complexity of a specific recurrence relation. The instructor systematically breaks down the problem T(n) = T(n/5) + T(3n/4) + O(n) by visualizing the recursive calls as a tree structure. The analysis focuses on calculating the work performed at each level of the tree, identifying a geometric series pattern in the summation of costs, and applying standard formulas to derive the final asymptotic complexity. The core pedagogical goal is to show how recursive structures can be flattened into summations to reveal their growth rates.

Chapters

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

    The session begins with the instructor presenting a specific recurrence relation problem: T(n) = 1 if n <= 1, and T(n/5) + T(3n/4) + O(n) if n > 1. The instructor explicitly points to the recursive terms T(n/5) and T(3n/4), underlining them to emphasize the branching nature of the problem. He then initiates a visual representation by drawing a recursion tree, placing T(n) at the root node. This initial phase establishes the problem structure and sets up the visual framework for analyzing how input size decreases at each recursive step.

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

    The instructor proceeds to expand the recursion tree, branching T(n) into its two subproblems: T(n/5) on the left and T(3n/4) on the right. He methodically calculates the problem size for subsequent levels, showing how T(n/5) further splits into T(n/25) and T(3n/20). The visual focus shifts to tracking the input size reduction, specifically simplifying fractions like (3n/4)/5 to 3n/20. This section demonstrates the mechanical process of expanding recursive calls and deriving the arguments for child nodes based on the parent node's size.

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

    The analysis shifts from structural expansion to cost calculation at each level of the tree. The instructor sums the non-recursive work O(n) contributed by nodes at each depth, simplifying terms like n/5 + 3n/4 into a single fraction (19n)/20. He continues this process for deeper levels, deriving expressions such as n(19/20)^k. The visual evidence shows the instructor writing out summation formulas and identifying a geometric progression pattern where the total work per level decreases by a factor of 19/20. This step is crucial for transitioning from the tree structure to a mathematical series.

  4. 10:00 – 12:43 10:00-12:43

    In the final phase, the instructor consolidates the level-wise costs into a summation series representing the total work done. He identifies the terms as a geometric progression with a common ratio r = 19/20, which is less than 1. Using the formula for a decreasing geometric series sum, he factors out 'n' and applies the standard summation notation to conclude that the total complexity is O(n). The board displays the final derivation, confirming that the dominant term comes from the root level due to the decreasing nature of the series.

The lecture provides a clear, step-by-step walkthrough of solving recurrence relations using the recursion tree method. The instructor effectively bridges the gap between abstract recursive definitions and concrete mathematical analysis by visualizing the problem as a tree. Key takeaways include the method for calculating subproblem sizes at each level, the technique for summing costs per depth to identify geometric series patterns, and the application of summation formulas to determine asymptotic bounds. The specific example T(n) = T(n/5) + T(3n/4) + O(n) serves as a practical demonstration of how unequal splits in recursion can still result in linear time complexity if the sum of fractions is less than one.

Loading lesson…