Scribd
Upload
4 views

Module_3

This document covers various software testing techniques including Boundary Value Testing (BVT), Robustness Testing, Worst Case Testing, and Equivalence Class Testing. BVT focuses on testing values at the edges of valid and invalid partitions, while Robustness Testing examines how systems handle unexpected inputs. The document also outlines the number of test cases generated by each technique and highlights the importance of these testing methods in identifying potential issues and ensuring software stability.

Uploaded by

Sheela Maharajpet
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views

Module_3

This document covers various software testing techniques including Boundary Value Testing (BVT), Robustness Testing, Worst Case Testing, and Equivalence Class Testing. BVT focuses on testing values at the edges of valid and invalid partitions, while Robustness Testing examines how systems handle unexpected inputs. The document also outlines the number of test cases generated by each technique and highlights the importance of these testing methods in identifying potential issues and ensuring software stability.

Uploaded by

Sheela Maharajpet
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 44

MODULE - 3

BOUNDARY VALUE TESTING,


EQUIVALENCE CLASS TESTING, AND
DECISION TABLE BASED TESTING.
BOUNDARY VALUE TESTING:
• BOUNDARY VALUE ANALYSIS IS BASED ON TESTING THE BOUNDARY VALUES OF
VALID AND INVALID PARTITIONS.
• THE BEHAVIOR AT THE EDGE OF THE EQUIVALENCE PARTITION IS MORE LIKELY TO BE
INCORRECT THAN THE BEHAVIOR WITHIN THE PARTITION, SO BOUNDARIES ARE AN
AREA WHERE TESTING IS LIKELY TO YIELD DEFECTS.
• IT CHECKS FOR THE INPUT VALUES NEAR THE BOUNDARY THAT HAVE A HIGHER
CHANCE OF ERROR.
• EVERY PARTITION HAS ITS MAXIMUM AND MINIMUM VALUES AND THESE MAXIMUM
AND MINIMUM VALUES ARE THE BOUNDARY VALUES OF A PARTITION.
 A BOUNDARY VALUE FOR A VALID PARTITION IS A VALID BOUNDARY VALUE.
 A BOUNDARY VALUE FOR AN INVALID PARTITION IS AN INVALID BOUNDARY VALUE.
 FOR EACH VARIABLE WE CHECK-

• MINIMUM VALUE.
• JUST ABOVE THE MINIMUM.
• NOMINAL VALUE.
• JUST BELOW MAX VALUE.
• MAX VALUE.
• EXAMPLE: CONSIDER A SYSTEM THAT ACCEPTS AGES FROM 18 TO 56.

• VALID TEST CASES: VALID TEST CASES FOR THE ABOVE CAN BE ANY VALUE ENTERED >17 AND <57
• ENTER THE VALUE - 18.
• ENTER THE VALUE - 19.
• ENTER THE VALUE - 37.
• ENTER THE VALUE - 55.
• ENTER THE VALUE - 56.
• INVALID TEST CASES: WHEN ANY VALUE LESS THAN 18 AND GREATER THAN 56 IS ENTERED.
• ENTER THE VALUE - 17.
• ENTER THE VALUE - 57.
• THE FOCUS OF BVA: BVA FOCUSES ON THE INPUT VARIABLE OF THE FUNCTION. LET’S
DEFINE TWO VARIABLES X1 AND X2, WHERE X1 LIES BETWEEN A AND B AND X2 LIES
BETWEEN C AND D.

• THE BASIC IDEA OF BOUNDARY VALUE ANALYSIS IS TO USE INPUT VARIABLE VALUES AT
THEIR MINIMUM, JUST ABOVE THE MINIMUM, A NOMINAL VALUE, JUST BELOW THEIR
MAXIMUM, AND AT THEIR MAXIMUM.
• THERE IS A COMMERCIALLY AVAILABLE TESTING TOOL (NAMED T) THAT GENERATES SUCH
TEST CASES FOR A PROPERLY SPECIFIED PROGRAM.
• THE T TOOL REFERS TO THESE VALUES AS MIN, MIN+, NOM, MAX- AND MAX
• THE BOUNDARY VALUE ANALYSIS TEST CASES FOR OUR FUNCTION F OF TWO VARIABLES
ARE:

• FOR A FUNCTION OF N VARIABLES, BOUNDARY VALUE ANALYSIS YIELDS 4N + 1 TEST CASES.


EXAMPLE:
IF ANY OF THESE CONDITIONS IS VIOLATED OUTPUT IS NOT A
TRIANGLE.
• FOR EQUILATERAL TRIANGLE ALL THE SIDES ARE EQUAL.
• FOR THE ISOSCELES TRIANGLE EXACTLY ONE PAIR OF SIDES IS
EQUAL.
• FOR SCALENE TRIANGLE ALL THE SIDES ARE DIFFERENT.

The total number of test cases are,


4n+1 = 4*3+1 = 13
ROBUSTNESS TESTING:
• ROBUSTNESS TESTING IS ANOTHER VARIANT OF BVA
• IN BVA, WE REMAIN WITHIN THE LEGITIMATE BOUNDARY OF OUR
RANGE I.E. FOR TESTING WE CONSIDER VALUES LIKE (MIN, MIN+, NOM,
MAX-, MAX) WHEREAS IN ROBUSTNESS TESTING, WE TRY TO CROSS
THESE LEGITIMATE BOUNDARIES AS WELL.
• THUS FOR TESTING HERE WE CONSIDER THE VALUES LIKE (MIN-, MIN,
MIN+, NOM, MAX-, MAX, MAX+)
• FOR A PROGRAM WITH N-VARIABLES, ROBUSTNESS TESTING WILL
YIELD (6N + 1) TEST CASES. THUS WE CAN DRAW THE
FOLLOWING ROBUSTNESS TEST CASES GRAPH.
• THE PURPOSE OF ROBUSTNESS TESTING IS TO IDENTIFY THE PARTS OF THE SYSTEM THAT ARE MOST
VULNERABLE TO FAILURE AND TO DETERMINE HOW THE SYSTEM CAN BE MADE MORE RESISTANT TO
FAILURE.
• ROBUSTNESS TESTING IS TYPICALLY CONDUCTED DURING THE LATER STAGES OF SOFTWARE TESTING
AFTER THE SOFTWARE HAS BEEN SHOWN TO WORK CORRECTLY UNDER NORMAL CONDITIONS.
• A COMMON EXAMPLE OF ROBUSTNESS TESTING IS TESTING HOW A SYSTEM RESPONDS TO
UNEXPECTED INPUT VALUES.
• FOR EXAMPLE, IF A SYSTEM IS DESIGNED TO ACCEPT NUMERICAL INPUT VALUES BETWEEN 1 AND 10, A
ROBUSTNESS TEST WOULD INVOLVE TRYING TO INPUT VALUES OUTSIDE OF THIS RANGE, SUCH AS 0,
11, OR -5, TO SEE HOW THE SYSTEM RESPONDS.
WHY IS ROBUSTNESS TESTING
IMPORTANT?
• HANDLE UNEXPECTED INPUTS: ROBUSTNESS TESTING IS IMPORTANT BECAUSE IT HELPS ENSURE THAT A
SYSTEM CAN HANDLE UNEXPECTED OR ABNORMAL INPUTS WITHOUT CRASHING.
• UNCOVER POTENTIAL ISSUES: THIS TYPE OF TESTING CAN HELP UNCOVER POTENTIAL ISSUES THAT
COULD CAUSE A SYSTEM TO FAIL IN UNEXPECTED WAYS. BY UNCOVERING THESE ISSUES EARLY ON, THEY
CAN BE FIXED BEFORE THE SYSTEM IS PUT INTO PRODUCTION.
• TEST LIMITS: IT ALLOWS DEVELOPERS TO TEST THE LIMITS OF THEIR SOFTWARE AND ENSURE THAT IT
CAN HANDLE UNEXPECTED INPUTS AND SITUATIONS.
• UNCOVER HIDDEN BUGS: THIS TYPE OF TESTING CAN HELP UNCOVER HIDDEN BUGS THAT COULD CAUSE
MAJOR PROBLEMS IN THE FIELD.
• STABILITY: THIS CAN HELP TO PREVENT SOFTWARE FAILURES AND CRASHES, AND CAN ALSO HELP TO
IMPROVE THE OVERALL STABILITY OF YOUR SOFTWARE.
WORST CASE TESTING
• WORST-CASE BOUNDARY VALUE ANALYSIS IS A BLACK BOX SOFTWARE TESTING
TECHNIQUE.
• IN WORST CASE BOUNDARY VALUE TESTING, WE MAKE ALL COMBINATIONS OF
EACH VALUE OF ONE VARIABLE WITH EACH VALUE OF ANOTHER VARIABLE.
• REJECTS THE SIMPLE FAULT ASSUMPTION AND TESTS ALL COMBINATIONS OF
VALUES.
• INSTEAD OF 4N+1 TEST CASES, WE HAVE 5N
• OFTEN LEADS TO A LARGE NUMBER OF TEST CASES WITH LOW BUG-FINDING
POWER WORST-CASE.
• ADD THE VALUES MIN– AND MAX+ TO THE POSSIBLE VARIABLE VALUES.
LIMITATIONS

• DOES NOT WORK WELL FOR BOOLEAN VARIABLES


• DOES NOT WORK WELL FOR LOGICAL VARIABLES
- PIN, TRANSACTION TYPE
• ASSUMES INDEPENDENT VARIABLES
EXAMPLE:
SPECIAL VALUE TESTING:
• SPECIAL VALUE TESTING IS PROBABLY THE MOST WIDELY PRACTICED
FORM OF FUNCTIONAL TESTING. IT ALSO IS THE MOST INTUITIVE AND
THE LEAST UNIFORM.
• SPECIAL VALUE TESTING OCCURS WHEN A TESTER USES HIS/HER
DOMAIN KNOWLEDGE, EXPERIENCE WITH SIMILAR PROGRAMS, AND
INFORMATION ABOUT “SOFT SPOTS” TO DEVISE TEST CASES.
• EVERY FUNCTIONALITY OF THE SYSTEM IS TESTED BY PROVIDING
APPROPRIATE INPUT, VERIFYING THE OUTPUT, AND COMPARING THE
ACTUAL RESULTS WITH THE EXPECTED RESULTS.
• AS A RESULT, SPECIAL VALUE TESTING IS VERY DEPENDENT ON THE
ABILITIES OF THE TESTER.
IN GENERAL

• BOUNDARY VALUE TESTING YIELDS 4N+1 TEST CASES.

• ROBUSTNESS TESTING YIELDS 6N+1 TEST CASES.

• WORST CASE TESTING YIELDS 5^N TEST CASES.

• ROBUST WORST CASE TESTING YIELDS 7^N TEST CASES.


EXAMPLES:
THE TRIANGLE PROBLEM AND THE NEXT DATE PROBLEM.

NEATES-BVA-TESTING_EXAMPLE.PDF

UNIT-2-BOUNDARY-VALUE-TESTING.PDF
EQUIVALENCE CLASS TESTING
• ALSO KNOWN AS EQUIVALENCE CLASS PARTITIONING
(ECP) AND EQUIVALENCE PARTITIONING, IT IS A BLACK-BOX TESTING
TECHNIQUE USED IN SOFTWARE TESTING AS A MAJOR STEP IN THE SOFTWARE
DEVELOPMENT LIFE CYCLE (SDLC). THIS TESTING TECHNIQUE IS BETTER THAN
MANY OF THE TESTING TECHNIQUES.
• EQUIVALENCE PARTITIONING IS A TECHNIQUE OF SOFTWARE TESTING IN WHICH
INPUT DATA IS DIVIDED INTO PARTITIONS OF VALID AND INVALID VALUES.
• IF A CONDITION OF ONE PARTITION IS TRUE, THEN THE CONDITION OF ANOTHER
EQUAL PARTITION MUST ALSO BE TRUE, AND VICE VERSA.
• THE PRINCIPLE OF EQUIVALENCE PARTITIONING IS, TEST CASES SHOULD BE
DESIGNED TO COVER EACH PARTITION AT LEAST ONCE.
• THE EQUIVALENCE PARTITIONS ARE DERIVED FROM THE REQUIREMENTS AND
SPECIFICATIONS OF THE SOFTWARE.

You might also like