How to Geometrically identify Non-Differentiability?

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/general-aptitude-reasoning/calculus/differentiability-and-differentiation/asset-how-to-geometrically-identify-non-differentiability after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
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…