Equivalence Partitioning
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Paper 1 | Reasoning Test: 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, Puzzle Solving (Puzzles), Venn Diagram, Analogy, Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Calendar, Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Algebra, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Profit, Loss and Discount, Constraint Puzzles, Speed, Time and Distance, Traverse Surveying, Ratio and Proportion, Time and Work, Mensuration, Permutations and Combinations, Clocks and Calendars, Data Interpretation, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Blood Relations, Data Sufficiency
- Paper 1 | Numerical Analysis: Number System, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Algebra, Statistics, Data Interpretation, Mental Ability, Arithmetic, Logarithm, Profit and Loss, Simple Interest and Compound Interest, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Permutation and Combination, Probability, Sequences and Series, Powers, Surds and Logarithms, Subject-Verb Agreement, Sentence Completion, Geometry, Sentence Structure and Correction, Data Sufficiency, Trigonometry, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Probability, Statistics, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Graph Theory, Combinatorics
- Paper 1 | General Knowledge: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge, Polity, Indian Economy
- Paper 1 | 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, Transaction Management, Concurrency Control, Relational Calculus, Database Security & Authorization, Database Recovery
- Paper 1 | Data Communication & Network: 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, Network Security, Security in Mobile and Wireless Computing, Input Output Organisation, File Management, Hardware Basics, Terms & Abbreviations, Protocols & Services, Network Access Technologies, Cyber Safety and Security, Basics of COA
- Paper 2 | System Analysis & Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Security, Risk Management & Maintenance, extras
- Paper 2 | Programming Language (Java): Java Fundamentals, OOPS with Java, Array, String, IO & References, Generic & Collections, Multithreading, Java, Miscellaneous, Control Flow, OOPS with C++, Stack, C Fundamentals, Arrays & Pointers, Object Oriented Technology, Control Flow & Looping, Introduction to Python
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video is an educational lecture on the software testing technique of Equivalence Partitioning. It begins by defining the concept as a black-box testing method that divides input data into partitions of equivalent data to reduce the number of test cases. The instructor explains that the system should handle all data within a partition the same way, so testing one value from each partition is sufficient. The lecture then provides a concrete example: an application accepting an integer input from 1 to 100. This input range is partitioned into three equivalence classes: values less than 1 (invalid), values between 1 and 100 (valid), and values greater than 100 (invalid). The instructor demonstrates this by writing the three classes on the screen and suggests creating test cases with values like 0, 50, and 101 to verify the system's behavior. The video concludes with a 'Thanks for watching' screen.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title card for 'SOFTWARE ENGINEERING' and '#knowledgegate'. It then transitions to a slide titled 'Equivalence partitioning'. The instructor defines Equivalence Partitioning as a black-box testing technique that divides input data into partitions of equivalent data. The slide lists key points: the system should handle all equivalent data the same way, allowing for testing only one value per partition to save effort, and this technique can be used for both valid and invalid data. The instructor, Sanchit Jain, is visible in a small window, and the 'Knowledge Gate Educator' logo is present. The on-screen text clearly states, 'Equivalence Partitioning is a black box testing technique that divides the input data of a software unit into partitions of equivalent data.'
2:00 – 2:43 02:00-02:43
The video displays a new slide with an example. The instructor explains a scenario where an application accepts an integer input from 1 to 100. The slide lists the equivalence classes: 'less than 1 (invalid)', 'between 1 and 100 (valid)', and 'greater than 100 (invalid)'. The instructor uses a red pen to circle these three classes on the screen. The text on the slide states, 'You would then create test cases to input a value from each of these classes (for example, 0, 50, and 101) and verify the system's behavior.' The video ends with a 'Thanks for watching' screen.
The lecture systematically introduces Equivalence Partitioning as a fundamental black-box testing strategy. It first establishes the theoretical foundation by defining the technique and its core principle of reducing test cases by testing one representative from each partition. The lesson is then solidified with a practical, real-world example. By applying the concept to a simple integer input range, the instructor demonstrates how to identify valid and invalid equivalence classes, making the abstract concept tangible. The progression from definition to example provides a clear and effective learning path for understanding this essential software testing method.

