Subtract and Conquer

Duration: 2 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-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
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
Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
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
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
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 | 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
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
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-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
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)
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
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)
Coal India Previous Year Paper:
Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
Coal India Mock Test:

AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video focuses on analyzing the time complexity of a specific recurrence relation commonly found in divide-and-conquer algorithms. The instructor presents the inequality T(n) <= c if n <= 1, and aT(n-b) + f(n) if n > 1. He explains that a represents the number of subproblems, b is the reduction in problem size, and f(n) is the cost of dividing and combining. The core of the lesson involves determining the Big-O complexity of T(n) given that f(n) is O(n^k). The instructor systematically breaks down the solution into three distinct scenarios based on the value of a.

Chapters

0:00 – 2:00 00:00-02:00
The instructor begins by writing the recurrence relation on the screen. He then draws a rough tree diagram to illustrate the recursive structure, labeling the root as T(n) and the branches as T(n-b). He explicitly writes the condition 'If f(n) is O(n^k)' to set the context for the complexity analysis. Following this, he lists three numbered cases on the left side of the screen. Case 1 states that if a < 1, then T(n) = O(n^k). Case 2 states that if a = 1, then T(n) = O(n^{k+1}). Case 3 states that if a > 1, then T(n) = O(n^k a^{n/b}). As he discusses each case, he draws a blue checkmark next to it to indicate validity or completion of the point. He also circles the assumption f(n) = O(n^k) to emphasize its importance.
2:00 – 2:04 02:00-02:04
The video ends with the instructor having completed the list of cases. The screen displays the full recurrence relation at the top and the three solved cases at the bottom, providing a complete reference for this specific type of recurrence.

The lecture provides a concise summary of the solution for a linear recurrence relation where the problem size decreases by a constant b at each step. It categorizes the complexity based on whether the number of subproblems (a) is less than, equal to, or greater than 1, assuming the non-recursive work is polynomial.