A software testing technique that involves identifying a small set of representative input values that invoke as many different input conditions as possible.
For example, for binary search the following partitions exist: inputs that do or do not conform to pre-conditions, Inputs where the key element is or is not a member of the array. One can combine these into finer partitions. One can also pick specific conditions of the array, e.g. a single value, even or odd number of elements. One should look at boundary conditions, e.g. inputs where the key element is the first or last element in the array.
- Equivalence partitioning
equivalence class partitioning
noun, Mathematics. 1. a relation that is reflexive, symmetrical, and transitive, as equality. noun 1. (logic, maths) a relation that is reflexive, symmetric, and transitive: it imposes a partition on its domain of definition so that two elements belong to the same subset if and only if the relation holds between them
[ih-kwiv-uh-luh n-see] /ɪˈkwɪv ə lən si/ noun, plural equivalencies. 1. (defs 1, 2). /ˌɛkwɪˈveɪlənsɪ/ noun 1. (chem) the state of having equal valencies
- Equivalent circuit
noun 1. an arrangement of simple electrical components that is electrically equivalent to a complex circuit and is used to simplify circuit analysis