Boundary value analysis is not White box technique - Software Specification & Measurement

Q.  Which of the following techniques is not a White box technique?
- Published on 24 Jul 15

a. Statement Testing and coverage
b. Decision Testing and coverage
c. Condition Coverage
d. Boundary value analysis

ANSWER: Boundary value analysis
 

    Discussion

  • Nirja Shah   -Posted on 05 Oct 15
    Boundary value analysis
    - It is a software testing technique in which tests are designed to include representatives of boundary values in a range.
    - The idea comes from the boundary.
    - Given that we have a set of test vectors to test the system, a topology can be defined on that set.
    - Those inputs which belong to the same equivalence class as defined by the equivalence partitioning theory would constitute the basis.
    - Given that the basis sets are neighbors, there would exist a boundary between them.
    - The test vectors on either side of the boundary are called boundary values.
    - In practice this would require that the test vectors can be ordered, and that the individual parameters follows some kind of order (either partial order or total order).

    Statement Testing and coverage
    - It is a white box testing technique, which involves the execution of all the statements at least once in the source code.
    - It is a metric, which is used to calculate and measure the number of statements in the source code which have been executed.
    - By using this technique we can check what the source code is expected to do and what it should not.
    - It can also be used to check the quality of the code and the flow of different paths in the program.
    - The main drawback of this technique is that we cannot test the false condition.
    - It is purely a white box testing method.
    - It tests the software’s internal coding and infrastructure and the programmer is the one who should take the initiative to do this.

    Decision Testing and coverage
    - This testing method aims to ensure that each branch from each decision point is executed at least once and it also ensures that all the reachable code is executed.
    - Every decision is taken each way, true and false.
    - It helps in validating all the branches in the code making sure that no branch leads to abnormal behavior of the application.

    Condition Coverage
    - It is also known as Predicate Coverage.
    - Here each one of the Boolean expression have been evaluated to both TRUE and FALSE.

Post your comment / Share knowledge


Enter the code shown above:
 
(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)