Matching Software Testing Techniques: List I with List II

This question requires matching software testing techniques from List I with their corresponding descriptions in List II. Let's break down each technique and its definition to find the correct pairings.

Explanation of Test Techniques and Descriptions

Matching Equivalence Partitioning (A) with Description (II)

Equivalence Partitioning is a black-box testing technique used to reduce the number of test cases. It involves dividing the input data of a software item into partitions of equivalent data from which test cases can be derived. The core idea is that testing one condition from each partition is equivalent to testing any other condition from the same partition. Therefore, it:

• Divides input data into classes or partitions.
• Identifies both valid and invalid partitions.
• Tests one case from each partition, assuming other cases in the same partition will behave similarly.

This aligns perfectly with Description II: "Divides input into valid/invalid sets".

Matching Boundary Value Analysis (B) with Description (III)

Boundary Value Analysis (BVA) is closely related to Equivalence Partitioning. While Equivalence Partitioning focuses on partitions, BVA specifically targets the boundaries or edges of these partitions. It is based on the observation that errors often occur at the boundaries of input ranges. Therefore, it:

• Tests values at the minimum, maximum, and just inside/outside the boundaries of input ranges.
• Complements Equivalence Partitioning by providing more detailed testing around critical limits.

This matches Description III: "Focuses on limits of input ranges".

Matching Cyclomatic Complexity (C) with Description (I)

Cyclomatic Complexity is a software metric used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent paths through a program's source code. Developed by Thomas McCabe, Sr., it provides a measure of the complexity of the code, which can help in determining the minimum number of test cases required to achieve certain levels of code coverage.

• Calculates the number of independent paths in the control flow graph of the software.
• Helps in estimating testing effort and identifying overly complex modules.
• A higher complexity score suggests more potential for defects.

This corresponds to Description I: "Measures independent paths in code".

Matching Decision Table Testing (D) with Description (IV)

Decision Table Testing is a technique used for testing systems where the output is dependent on a combination of input conditions. It's particularly useful for complex business logic, situations involving multiple conditions, and when the number of possible combinations needs to be managed systematically. A decision table:

• Lists all possible combinations of conditions (inputs).
• Specifies the actions (outputs) for each combination of conditions.
• Helps ensure that all logical possibilities are considered and tested.

This precisely matches Description IV: "In which a number of combinations of actions are tested under varying sets of conditions."

Final Matching

Based on the explanations above, the correct matches are:

• A. Equivalence Partitioning - II. Divides input into valid/invalid sets
• B. Boundary Value Analysis - III. Focuses on limits of input ranges
• C. Cyclomatic Complexity - I. Measures independent paths in code
• D. Decision Table Testing - IV. In which a number of combinations of actions are tested under varying sets of conditions.

Therefore, the correct option combines these matches.