Boundary Value Testing

1) Boundary Value Testing is one of the popular

software testing mechanism, where testing of data
is done based on boundary values or between two
opposite ends.
2) This black box testing strategy was introduced after
equivalence class.
3) The testing is an analysis testing process that does testing

practices at the boundaries of the partition covering all the testing

defects where equivalence testing alone was difficult to handle

those defects.

4) The boundary values of such a testing mechanism are identified by

the values present at the extreme boundaries, i.e. minimum and

maximum value.

5) This is used mainly to analyze the testing at the partition boundaries

and also to detect anomalies that may occur during testing cases.

6) The black box testing techniques are helpful for detecting any errors

or threats that happened at the boundary values of valid or invalid

partitions rather than focusing on the center of the input data.

ROBUST TESTING
In robustness testing, the software is tested by giving invalid
values as inputs.
Robustness testing is usually done to test exception handling.
In robust boundary value testing, we make combinations in
such a way that some of the invalid values are also tested as
input.
The type of testing done by causing the software or system to
fail in order to test the robustness is called robustness testing.
Equivalence Partitioning
1) Equivalence class testing (Equivalence class
Partitioning) is a black-box testing technique used in
software testing as a major step in the Software
development life cycle (SDLC).
2) It is a black box testing technique which restricts the testers to
examine the software product, externally.

3) Also known by the name of equivalence class partitioning, it is

used to form groups of test inputs of similar behaviour or nature.

4) Test cases are based on classes, not on every input, thereby

reduces the time and efforts required to build large number of test
cases.

5) It may be used at any level of testing i.e. unit, integration, system &
acceptance.

6) It may results into good amount of decrease in the redundant test

cases, if implemented properly.

7) A mixed combination of Equivalence class testing and boundary

value testing produces effective results.\
Traditional Equivalence Class Testing
Decision Table Based Testing

Decision tables are used in various engineering fields to represent

complex logical relationships.
This testing is a very effective tool in testing the software and its
requirements management.
In software testing, the decision table has 4 parts which are divided
into portions and are given below :
Condition Stubs : The conditions are listed in this first upper left part
of the decision table that is used to determine a particular action or
set of actions.
Action Stubs : All the possible actions are given in the first lower left
portion (i.e, below condition stub) of the decision table.
Condition Entries : In the condition entry, the values are inputted in
the upper right portion of the decision table. In the condition entries
part of the table, there are multiple rows and columns which are
known as Rule.
Action Entries : In the action entry, every entry has some associated
action or set of actions in the lower right portion of the decision
table and these values are called outputs.
ADVANTAGES AND DISADVANTAGES OF DECISION
TABLE
Advantage :-

1 . They are easier to draw.

2 . They provide a compact representation of the decision making
process. A small table can be replace several pages of flow chart.
3 . Decision table can be changed according to the situation.
4 . It is also much easier to understand a particular path down one
column than through several pages of the flow chart.
5 . Decision tables are based suited for calculating discount,
commissions or inventory control procedures.
Disadvantage :-

1 . Decision table can not express the complete sequence of

operations to solve a problem, It may be difficult for a programmer
to translate a decision table directly into a computer program.
2 . When there are two many alternatives, decision table cannot list
them all.
3 . Decision table does not depict the flow of logic for the solution to
a given problem.
4. Need to decide or know what conditions are relevant for testing
5. they do not show the sequence of decisions
Path Testing
1) Path testing is a structural testing method that
involves using the source code of a program in order to
find every possible executable path.
2) It helps to determine all
faults lying within a piece of code.
3) This method is designed to execute all or selected
path through a computer program.

4) Path Testing Techniques:

• Control Flow Graph (CFG) - The Program is converted into Flow
graphs by representing the code into nodes, regions and edges.
• Decision to Decision path (D-D) - The CFG can be broken into
various Decision to Decision paths and then collapsed into individual
nodes.
• Independent (basis) paths - Independent path is a path through a
DD-path graph which cannot be reproduced from other paths by
other methods.
Basis Path Testing
Basis Path Testing in software engineering is a White Box Testing method in
which test cases are defined based on flows or logical paths that can be
taken through the program.
The objective of basis path testing is to define the number of independent
paths, so the number of test cases needed can be defined explicitly to
maximize test coverage.
Basis path testing involves execution of all possible blocks in a program and
achieves maximum path coverage with the least number of test cases.
It is a hybrid method of branch testing and path testing methods.
DECISION TABLE TECHNIQUES

Types of Decision Tables:

1. Extended Entry Table:

In this type of entry table both the entry and stub section of any
specific condition must be considered together to decide if a
condition is applicable to a given rule. This type of table is
applicable in describing problems with few variables which may
have many different values. In addition, it may save space.

2. Limited Entry Table:

A limited entry table is so called because the conditions or actions

required are contained within the appropriate stubs, symbols are
used in the entry sections (e.g., conditions = Y, N or; Actions =
numbers or blanks) to relate specific rules. This type of table is the
most widely used in practice.