11 Flow Based Testing

Question 1

UMM Drawbacks

Answer 1

Difficult to construct
Focused on only simple links

Question 2

Decomposition into structured CFGs

Answer 2

Sequential concatenation is allowed.
Nesting is allowed
No goto’s
Unique entry and unqiue exit.

Question 3

Bottom-up path defintion

Answer 3

Sequential concatenation
Nesting

Question 4

Nesting Path Count

Answer 4

M - 1 + N

M = # of path from outer graph.
N = # of path from inner (nested) graph.

Question 5

Sequential Concatenation Path Count

Answer 5

M X N

Question 6

Path Sensitization

Answer 6

Not all deicisions are independent or sensible paths any more.

Question 7

CFT Advantage

Answer 7

Increased power in covering dynamic decisions and interaction problems.

Question 8

CFT Issues

Answer 8

Due to path empahsis.

Number of test cases increases substantially.
Additional cost related to more test cases.

Question 9

DFT

Answer 9

Addresses dependencies among data items.
- Input variables.
- Constants
- Intermediate Variables
- Output variables.

Question 10

DFT Data Operations

Answer 10

Data Definitions (D-Operation)
- Create and destruction of data
Data Use (U)
- C-Use (Computation)
- P-Use (Predicate)

Question 11

Data Operation Relations

Answer 11

D-U: Normal Usage Case
D-D: Later defintion destroys the previous one.
U-U: No effect on data dependency (Ignored in DFT)
U-D: Anti-Usage (Indicates a problem)

Question 12

DDG

Answer 12

Data Dependency Graph

A logical graph where computational results are expressed in terms of input variables and constants through the possible use of some intermediate data items as nodes and related D-U relations as links.