Master Theorem Case 2

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/algorithms/time-complexity-analysis/master-theorem/asset-master-theorem-case-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  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
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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
  10. 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
  11. 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
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics
  13. General Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Time and Work, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Interjection, Verb, Articles, Adverb, Modals, Sentence Construction
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video segment focuses on Case 2 of the Master Theorem, a method for solving recurrence relations in algorithm analysis. The instructor begins by displaying the formal statement of Case 2 on a slide, which reads: if f(n) = Θ(n^(log_b a)), then T(n) = Θ(n^(log_b a) lg n). He then transitions to a practical example, writing the recurrence relation T(n) = 2T(n/2) + n on the screen. He systematically identifies the parameters a=2, b=2, and f(n)=n. The core of the lesson involves verifying that the function f(n) satisfies the condition for Case 2 by comparing it to n^(log_b a). He calculates n^(log_2 2) to be n, confirming that f(n) is indeed Θ(n). He explicitly rules out Case 1 and Case 3 by showing that n is not O(n^(1-epsilon)) nor Omega(n^(1+epsilon)). Finally, he applies the Case 2 formula to derive the final time complexity T(n) = Θ(n lg n), noting this is the standard complexity for algorithms like Merge Sort.

Chapters

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

    The instructor introduces Case 2 of the Master Theorem using a slide that states the condition f(n) = Θ(n^(log_b a)) leads to T(n) = Θ(n^(log_b a) lg n). He writes the recurrence T(n) = 2T(n/2) + n and identifies the parameters a=2, b=2, and f(n)=n. He calculates the critical exponent n^(log_b a) as n^(log_2 2) = n. He then performs a verification step, writing n = O(n^(1-epsilon)) and marking it with an X to show it does not fit Case 1, establishing that f(n) matches the critical term exactly.

  2. 2:00 – 3:36 02:00-03:36

    Having confirmed the condition for Case 2, the instructor proceeds to calculate the final complexity. He writes the solution formula T(n) = Θ(n^(log_b a) lg n) and substitutes the values a=2 and b=2. This simplifies to T(n) = Θ(n^1 lg n), which he writes as T(n) = Θ(n lg n). He emphasizes that this result represents the logarithmic-linear time complexity often seen in divide-and-conquer algorithms like Merge Sort, concluding the derivation for this specific recurrence relation.

The video effectively bridges the gap between the abstract Master Theorem and concrete application. By walking through the identification of parameters and the verification of the specific case condition, the instructor demonstrates a rigorous method for solving recurrences. The progression from the theorem statement to the final Big-Theta result provides a clear template for students to follow when analyzing similar algorithmic complexities.

Loading lesson…