continuity
Duration: 7 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 lecture on the topic of Continuity within Calculus, presented by Yash Jain Sir from Knowledge Gate. The lesson begins by establishing the fundamental definition of a function, describing it as a mapping from an input to an output or from a domain to a range. The instructor uses a whiteboard to visually demonstrate these concepts, starting with a discrete function example f(x) = x^2 where the domain {1, 2, 3} maps to the range {1, 4, 9}. He then transitions to the core topic, defining continuity at a specific point x=a. The lecture systematically breaks down the mathematical requirements for a function to be considered continuous, emphasizing the relationship between limits and function values. The visual aids include graphs of continuous and discontinuous functions, along with key formulas written in blue and red ink.
Chapters
0:00 – 2:00 00:00-02:00
The session opens with a title card reading CALCULUS before cutting to the instructor. He introduces the concept of a function f with the notation Input to Output and Domain to Range. He writes a specific example on the board: f(x) = x^2 with a domain set {1, 2, 3} mapping to a range set {1, 4, 9}. He further clarifies the notation f: R to R, explaining it represents a set of all real numbers. This section sets the foundational vocabulary necessary for understanding the subsequent discussion on continuity. The instructor is wearing a blue polo shirt with the KG Knowledge Gate logo. The header Continuity at a point is visible at the top right.
2:00 – 5:00 02:00-05:00
The instructor moves to the definition of continuity. He writes the central condition: f(x) is continuous at x=a if the limit as x approaches a of f(x) equals f(a). To ensure clarity, he lists three specific conditions required for this equality to hold: a) f(a) must exist, b) the limit as x approaches a of f(x) must exist, and c) LHL (Left Hand Limit) must equal RHL (Right Hand Limit) and both must equal the value of the function. He draws three graphs to illustrate these concepts: a smooth curve representing continuity, a graph with a jump discontinuity, and a graph with a hole. He writes in red text, at x=a there must be no breaks and no hole (no jump). The graphs have axes labeled with x, a, b, and c.
5:00 – 7:20 05:00-07:20
In the final segment, the instructor elaborates on the limit condition by expanding it into Left Hand Limit and Right Hand Limit notations. He writes the equation limit as x approaches a minus of f(x) equals limit as x approaches a plus of f(x) equals f(a). He points to the middle graph where the limit does not exist because the left side approaches a value b and the right side approaches a value c, writing b not equal to c and LHL not equal to RHL. He then points to the third graph where the limits might be equal (b=c) but there is an open circle at a, indicating a hole. He emphasizes that for true continuity, the limit must equal the actual function value, meaning no breaks or holes are allowed in the graph at that point. The text for this to happen is written next to the limit definition.
The lecture provides a structured introduction to continuity, moving from basic function definitions to the rigorous limit-based criteria. By combining algebraic conditions with graphical representations, the instructor clarifies that continuity requires the absence of breaks, jumps, or holes at a specific point. This visual and algebraic approach helps students identify continuous functions and understand the precise mathematical definition of the concept.

