How to Geometrically identify Non-Differentiability?

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/engineering-mathematics/calculus/differentiability-and-differentiation/asset-how-to-geometrically-identify-non-differentiability after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. 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, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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
  10. 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
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
  15. Paper 2 - Full-length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video features a lecture by Yash Jain Sir from Knowledge Gate on the geometric identification of non-differentiable points in calculus. The lesson systematically breaks down three specific geometric scenarios where a function fails to be differentiable. The instructor uses a whiteboard to write definitions, equations, and draw graphs to illustrate these concepts visually. The core message is that differentiability requires a smooth curve with a unique tangent line at every point in the domain. The video serves as a visual guide for students to recognize these critical points on graphs, emphasizing that sharp corners, cusps, and vertical tangents are the primary geometric indicators of non-differentiability.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video begins with an intro screen displaying 'CALCULUS' surrounded by mathematical formulas like cos x and sin x. The instructor then writes the title 'How to Geometrically Identify Non-Differentiability' on the whiteboard. He introduces the first condition: 'Bend / sudden change / sharp turn'. He writes the function f(x) = |x| and draws its characteristic V-shaped graph. He points to the origin (0,0) where the graph has a sharp corner. He explains that at this sharp turn, you cannot draw a single unique tangent line. He draws dashed lines representing tangents on either side to show the abrupt change in slope. He writes 'tan theta' to represent the slope. He then moves to the second condition, writing 'cusp' on the board. He draws a graph resembling a bird or a cusp pointing downwards, labeling the sharp point as a cusp, indicating that functions with cusps are also non-differentiable at that specific point. He writes f(x) = sqrt(x) + 1 though the graph is a cusp.

  2. 2:00 – 4:48 02:00-04:48

    The lecture progresses to the third condition: 'Vertical line as slope (undefined slope)'. The instructor writes the function f(x) = x^(1/3) or cube root of x on the board. He sketches the graph of the cube root function, which passes through the origin. He highlights that at x=0, the tangent line is vertical. He draws a vertical red line at the origin to emphasize this. He writes theta = 90 degrees and explains that the slope is tan 90 degrees, which equals infinity. Since the derivative f'(a) represents the slope, and the slope is undefined (infinity), the function is not differentiable at that point. He concludes by writing f'(a) -> infinity to summarize the mathematical implication of a vertical tangent. He points to the graph and the equation to reinforce the connection between the visual vertical line and the undefined derivative.

The video effectively connects geometric intuition with calculus definitions. By categorizing non-differentiability into sharp turns, cusps, and vertical tangents, it provides a clear visual checklist for students to identify points where derivatives do not exist. The instructor uses clear board work and specific examples like the absolute value function and cube root function to solidify these concepts.

Loading lesson…