Subtract and Conquer
Duration: 2 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: 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
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- Computer Networks: 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
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.

