Please enable JavaScript.
Coggle requires JavaScript to display documents.
BLACK BOX TESTING, WHITE BOX TESTING, DRAWBACK - Coggle Diagram
BLACK BOX TESTING
CAUSE EFFECT GRAPHING
It begins with finding the relationships between the input conditionscauses and the output conditions known as effects
Each condition(either cause or effect) is represented as a node. Each condition has a value either TRUE :check: or FALSE :green_cross:
ERROR GUESSING
-
- NULL is an error prone area in the program
- Boolean values having values TRUE or FALSE are also
-
BOUNDARY VALUE ANALYSIS
The special case of equivalence classes where the test data are selected at and near the boundary of the equivalence classes.
-
WHITE BOX TESTING
-
PATH TESTING
It's focus is on identifying independent paths in a program. The idea is to design test cases to exercise all the independent paths atleast once.
The purpose of identifying the paths is to find the Mccabe Cyclomatic complexity measure in the program.
Cyclomatic complexity measure measures the logical complexity of the program. It defines the required number of independent paths in a CFG. thus helping in designing the number of test cases to ensure that each statement is executed at least once.
-
MUTATION TESTING
A test case is designed to find whether a mutant program behaves similarly or differently than its original program on some test data
If a mutant program is distinguished, it is called Dead Mutant else it is known as Live Moment (where the test case doesn't distinguish the mutant program from the original program)
DATA FLOW BASED TESTING
It concentrates on data flow representation. It focus on data declared and its use in the program. It uses definition - use graph.
MUTATION TESTING
Mutations are tested with test cases of the original program to determine whether the test case is capable of detecting the change between original and its mutant
It is concerned with exercising the source code. Internal logics such as control structures, control flow and data structures are considered.
-