Question
Below are two graphs, each of which is defined by the sets of nodes, initial nodes, final nodes, edges, and defs and uses. Each graph
Below are two graphs, each of which is defined by the sets of nodes, initial nodes, final nodes, edges, and defs and uses. Each graph also contains a collection of test paths. Answer the following questions about each graph.
GRAPH 1:
N = {1,2,3,4,5,6}
N0={1}
Nf={6}
E={(1,2),(2,3),(2,6),(3,4),(3,5),(4,5),(5,2)}
def(x)={1,3}
use(x)={3,6} //Assume the use of x in 3 precedes the def
Test Paths:
t1=[1,2,6]
t2=[1,2,3,4,5,2,3,5,2,6]
t3=[1,2,3,5,2,3,4,5,2,6]
t4=[1,2,3,5,2,6]
GRAPH 2:
N={1,2,3,4,5,6}
N0={1}
Nf={6}
E={(1,2),(2,3),(2,6),(3,4),(3,5),(4,5),(5,2)}
def(x)={1,5}
use(x)={5,6} //Assume the use of x in 5 precedes the def
Test Paths:
t1=[1,2,6]
t2=[1,2,3,4,5,2,3,5,2,6]
t3=[1,2,3,5,2,3,4,5,2,6]
- Draw the graph.
- List all of the du-paths with respect to x. (Note: Include all du-paths, even those that are sub-paths of some other du-path).
- List the test requirements for all-def criteria
- List the test requirements for all-use criteria.
- List the test requirements for all-du-path criteria
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started