Change of Variable Method
Duration: 10 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.
This lecture introduces the Change of Variable Method, a technique designed to transform non-standard recurrence relations into standard divide-and-conquer forms that satisfy the conditions of the Master Theorem. The instructor begins by defining the standard recurrence form T(n) = aT(n/b) + f(n), explicitly listing the necessary constraints: a >= 1 and b > 1. The core strategy involves substituting a new variable, typically m, to linearize the recursive argument. For recurrences involving roots or fractional exponents like T(n) = aT(n^(1/b)) + f(n), the substitution n = b^m is applied. This transformation converts the recursive term T(n^(1/b)) into a linear form in terms of m, allowing the application of standard asymptotic analysis techniques. The lecture progresses through specific examples, including a recurrence with a k-th root and the classic T(n) = T(sqrt(n)) + 1, demonstrating how to derive a new recurrence S(m), solve it using the Master Theorem cases, and finally substitute back to find the complexity in terms of n.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the Change of Variable Method as a technique to transform non-standard recurrences into standard divide-and-conquer forms suitable for the Master Theorem. He begins writing on the whiteboard, starting to formulate an example or equation related to this method. The instructor writes out the general form of a standard recurrence relation, T(n) = aT(n/b) + f(n), and lists the necessary conditions for its application, specifically noting 'a >= 1' and 'b > 1'. He then begins to define a new variable 'm' as part of the substitution process, setting up the framework for converting complex recursive arguments into linear ones.
2:00 – 5:00 02:00-05:00
The instructor demonstrates the Change of Variable Method to convert a non-standard recurrence relation into a standard divide-and-conquer form suitable for the Master Theorem. He starts with the recurrence T(n) = aT(n^(1/b)) + f(n) and introduces the substitution n = b^m. The process involves substituting this variable into the original equation to simplify the recursive term, showing that T(b^m) = aT(b^(m/b)) + f(b^m). He highlights the simplification of exponents using power rules, where b^(m/b) becomes (b^m)^(1/b), effectively transforming the recursive structure into a standard form T(n) = aT(n/b) + f(n).
5:00 – 9:40 05:00-09:40
The instructor solves a recurrence relation using the Change of Variable Method, specifically addressing T(n) = T(sqrt(n)) + 1. He substitutes variables to transform the original equation into a simpler form, identifying parameters like 'a', 'b', and g(m). He then applies Case 3 of the Master Theorem to derive the final complexity. On-screen text shows the derivation S(m) = aS(m/b) + g(m) where g(m) = 1, leading to the result O(log log n). The instructor highlights specific case conditions and simplifies logarithmic terms, demonstrating the complete workflow from non-standard recurrence to final asymptotic bound.
The lecture systematically builds the Change of Variable Method by first establishing the prerequisites for the Master Theorem, specifically the standard form T(n) = aT(n/b) + f(n). The instructor emphasizes that non-standard recurrences, such as those involving roots like T(n) = aT(n^(1/b)) + f(n), cannot be directly solved without transformation. The key mechanism is the substitution n = b^m, which linearizes the recursive argument. For example, transforming T(n) = aT(n^(1/b)) + f(n) into S(m) = aS(m/b) + g(m). The lecture culminates in solving T(n) = T(sqrt(n)) + 1, where the substitution n = 2^m leads to S(m) = S(m/2) + 1. Applying the Master Theorem yields S(m) = O(log m), which translates back to T(n) = O(log log n). This progression illustrates the method's utility in handling complex recursive structures by reducing them to solvable standard forms.

