Subtract and Conquer

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/algorithms/time-complexity-analysis/master-theorem/asset-subtract-and-conquer after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, 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
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): 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
  11. Computer Networks (Technical): 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 Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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

  1. 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. 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.

Loading lesson…