Maxima & Minima
Duration: 13 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 educational video features a calculus lecture by Yash Jain Sir focusing on the concepts of Maxima and Minima. The lesson begins by defining local and global extrema using a graphical representation of a function f(x) on a closed interval [a, b]. The instructor systematically evaluates three statements regarding the relationship between derivatives and extrema, identifying which are true and which are false through counter-examples like the function f(x) = x^3. The lecture concludes with a practical algorithm for finding absolute maxima and minima on a closed interval, emphasizing the need to check stationary points, endpoints, and points where the derivative is undefined.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title card displaying 'CALCULUS' surrounded by various mathematical formulas including integrals and series. The scene transitions to an instructor standing before a whiteboard titled 'Maxima & Minima' in red ink. He introduces a function f(x): [a, b] -> R and draws a continuous curve with multiple peaks and troughs. He identifies specific points on the x-axis labeled m1, m2, m3, m4, m5 corresponding to the local extrema. He writes 'local maxima' in red ink near the first peak and 'local minima' near the first trough, explaining that these points are higher or lower than their immediate neighbors. The instructor uses his hand to trace the curve, visually demonstrating the rise and fall of the function to establish the basic definitions of local extrema. He points specifically to the y-axis to show the function values.
2:00 – 5:00 02:00-05:00
The instructor distinguishes between local and global extrema. He writes 'global maxima' next to the highest peak (m1) and 'global minima' next to the lowest trough (m2), annotating them with f(m1) = max and f(m2) = min. He then lists three statements (S1, S2, S3) on the board to test student understanding. S1 states 'At every maxima/minima f'(x) = 0'. He marks this statement as 'True' with a red circle. He explains that at every smooth peak or trough, the tangent is horizontal, implying the derivative is zero. He also writes that every maxima/minima is a stationary point, reinforcing the connection between the geometric shape and the calculus concept of the derivative. He points to the right side of the board where he has written m1/m2/m3/m4/m5 -> stationary points.
5:00 – 10:00 05:00-10:00
The lecture shifts to disproving the other statements. The instructor writes f(x) = x^3 and draws its graph, which passes through the origin. He notes that at point A (the origin), f'(0) = 0, making it a stationary point. However, he explains that this point is neither a maxima nor a minima, labeling it a 'Saddle Point'. Consequently, he marks statement S2 ('If f'(x) = 0... then it must be maxima or minima') as false. He also marks S3 ('Maxima/minima is possible for all functions') as false using the same counter-example. He then introduces a new section 'Points to Note', writing point 1: 'maxima/minima -> f'(x) = 0 (not necessary)'. He draws a graph with a sharp corner (cusp) at a maximum, indicating that the derivative does not exist there, yet an extremum exists. He writes f'(a) != 0 next to the sharp peak.
10:00 – 13:20 10:00-13:20
The final segment details the procedure for finding extrema on a closed interval. The instructor writes point 2: 'maxima/minima happens only at stationary points (not necessary)'. He then writes point 3: 'At extreme points, check maxima/minima from single side'. He explains that at the left endpoint a, one only checks the right side (a+), and at the right endpoint b, one only checks the left side (b-). He draws a large box containing the algorithm: 'To compute maxima/minima in [a, b], we have to check all points where f'(x)=0, also we have to check extreme points, that is f(a) and f(b)'. The video concludes with a 'THANKS FOR WATCHING' screen. He emphasizes checking endpoints as part of the global extrema calculation.
The video provides a comprehensive overview of finding maxima and minima in calculus. It moves from visual definitions to analytical conditions, correcting common misconceptions about derivatives being the sole indicator of extrema. The final algorithm synthesizes these concepts into a step-by-step method for solving optimization problems on closed intervals, covering stationary points, endpoints, and non-differentiable points.

