Recurrence Relation - 13
Duration: 8 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
- Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
- Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
- Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
- Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
- Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
- Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
- Section B | Networking: 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
- Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
- Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
- Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- MOCK TEST:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture segment focuses on solving a specific recurrence relation problem to determine its asymptotic time complexity. The instructor begins by presenting the problem statement, which defines a function T(n) with a base case of 1 when n equals 1 and a recursive step defined as T(n-2) + n for all n greater than 1. The core of the lesson involves applying the iterative substitution method to expand this recurrence relation into a summation series. By repeatedly substituting the recursive term, the instructor identifies a pattern that transforms the problem into an arithmetic progression of odd numbers. The final derivation utilizes standard summation formulas to simplify the series, ultimately concluding that the time complexity of the recurrence is O(n^2).
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the problem by displaying a question asking for the time complexity of a recurrence relation. On-screen text clearly defines the function as T(n) = 1 for n=1 and T(n-2) + n for n > 1. The instructor writes the recursive step T(n) = T(n-2) + n on the screen and begins the solution process by substituting the term for T(n-2). This initial expansion shows the substitution of (n-2) into the recursive formula, resulting in T(n-4) + (n-2), demonstrating the first step of the iterative substitution method.
2:00 – 5:00 02:00-05:00
The instructor continues the iterative expansion of the recurrence relation to identify a general pattern. He writes out successive substitutions, showing T(n-2) = T(n-4) + (n-2), followed by T(n-4) = T(n-6) + (n-4). The instructor generalizes this process for k steps, writing the term T(n) = T(n-2k) + ... and explicitly noting the sequence of added terms as (n-2k+1). This section emphasizes recognizing the arithmetic progression within the recursive steps and setting up the equation for a general k-step expansion.
5:00 – 7:55 05:00-07:55
The instructor completes the derivation by expanding the recurrence into a full summation series. He identifies the resulting sequence as an arithmetic progression of odd numbers: 1 + 3 + 5 + 7 + ... + (n-2) + n. Using the summation formula for odd numbers, he applies the expression n(n+1)/4 to simplify the series. The final calculation shows (n^2+n)/4, leading to the conclusion that the asymptotic time complexity is O(n^2). The instructor also notes the value of k as (n-1)/2 to determine when the base case T(1) is reached.
The lecture demonstrates a systematic approach to solving recurrence relations using the iterative substitution method. The problem T(n) = T(n-2) + n is solved by expanding the recursive term repeatedly until a pattern emerges. The key insight is recognizing that the expansion results in an arithmetic series of odd numbers, which can be summed using standard formulas. The derivation shows that the sum is proportional to n squared, confirming a quadratic time complexity of O(n^2). This method highlights the importance of pattern recognition in algorithm analysis.

