How to Mathematically find Maxima & Minima?
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: 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
- 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
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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, Network Security, Hardware Basics
- 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
- 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, Complexity Theory
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video is a calculus lecture by Yash Jain Sir from Knowledge Gate Educator, focusing on the mathematical method to find maxima and minima. The instructor systematically outlines a step-by-step procedure on a whiteboard. The process begins with finding the first derivative $f'(x)$ and equating it to zero to identify stationary points $x_0$. The core of the lesson focuses on the second derivative test, where the sign of $f''(x_0)$ determines the nature of the point. If $f''(x_0) > 0$, it is a minimum; if $f''(x_0) < 0$, it is a maximum. The lecture also covers the higher-order derivative test for cases where the second derivative is zero, instructing students to check $f'''(x_0)$ and subsequent derivatives until a non-zero value is found to classify the point.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with an intro screen featuring the word 'CALCULUS' surrounded by various mathematical formulas. The instructor, Yash Jain Sir, appears in front of a whiteboard titled 'How to Mathematically find Maxima and Minima'. He writes down the first three steps of the procedure. Step 1 is to 'Find $f'(x)$'. Step 2 is to 'Equate $f'(x)$ to zero $[f'(x)=0]$ for obtaining the stationary points $[x=x_0]$'. Step 3 involves finding $f''(x_0)$ at each stationary point. He lists three conditions: a) If $f''(x_0) > 0 ightarrow$ min value, b) If $f''(x_0) < 0 ightarrow$ max value, and c) If $f''(x_0) = 0 ightarrow$ find $f'''(x_0)$.
2:00 – 5:00 02:00-05:00
The instructor continues to elaborate on the higher-order derivative test. He writes Step 4: 'If $f'''(x_0) eq 0 ightarrow$ no maxima/minima'. He further explains that if $f'''(x_0) = 0$, one must find $f^{IV}(x_0)$. He specifies the conditions for the fourth derivative: a) If $f^{IV}(x_0) > 0 ightarrow$ min value and b) If $f^{IV}(x_0) < 0 ightarrow$ max value. A note on the right side instructs to 'Repeat this process till the point is decided.' He also writes a crucial constraint: 'method applicable only at critical points where $f'(x)=0$ and not applicable to those critical points where $f'(x)$ remains undefined.' Additionally, he writes $[a, b]$ and checks $f(a)$ and $f(b)$, indicating the need to evaluate endpoints.
5:00 – 7:13 05:00-07:13
In the final segment, the instructor summarizes the entire procedure by pointing to the board. He emphasizes the logic of checking derivatives sequentially to decide the nature of the stationary point. He gestures towards the conditions written on the board, reinforcing the distinction between maxima, minima, and cases where no maximum or minimum exists (points of inflection). He reiterates that the method is for finding local extrema. The video concludes with a black screen displaying the text 'THANKS FOR WATCHING' in white, stylized font.
The lecture provides a comprehensive guide to finding local maxima and minima using derivatives. It establishes a clear hierarchy of tests: starting with the first derivative to find stationary points, then using the second derivative for classification, and finally employing higher-order derivatives if the second derivative vanishes. The instructor emphasizes the limitations of the method, specifically regarding points where the derivative is undefined, and the importance of checking endpoints in a given interval.

