Question this is the question :1. Below are four graphs, each of which is defined by the sets of nodes,initial nodes, final nodes, edges, and defs and uses. Each graph alsocontains some test paths. Answer the following questions about eachgraph.

5QJYGM The Asker · Computer Science

this is the question :1. Below are four graphs, each of which is defined by the sets of nodes,initial nodes, final nodes, edges, and defs and uses. Each graph alsocontains some test paths. Answer the following questions about eachgraph.

Transcribed Image Text: this is the question :1. Below are four graphs, each of which is defined by the sets of nodes,initial nodes, final nodes, edges, and defs and uses. Each graph alsocontains some test paths. Answer the following questions about eachgraph.

More

Community Answer

Honor Code

Solved 1 Answer

b) x has d 6-du paths an enumerated below(i) \left[\begin{array}{lll}1 & 2 & 3\end{array}\right](ii) [1,2,3,5](iii) (1,2,6](iv) [4,5](v) [4,5,2,3](v) [4,5,2,6]c) Ther numbers in the table below correspond to the de paths in the previous table, The table indicates whether each pest 'path Tours each do path with (or) without a sidetrip.Note that neither t_{1}(h \circ r) t_{2} fours du-path (v) either directly (or) with a side trip. Also note That neither t_{1} nor t_{2} tours du-path (iii) except with a sidetrip.d) This question has one possible answer: \left\{t_{2}\right\}e) for all uses all six dupaths must be toured, since the given test set doesnot have a tost path that directly tows either of due pathe (iii) (\circ r)(\mathrm{V}). This question is unsatisfable.To directly tour The given duepaths we would fwo addetional test paths. An example all uses adequate test set (direct toroing) is\left\{t_{1}, t_{2},[1,2,6],[1,3,4,5,2,3,5,2,6]\right\}for this Excercise all-du-paths Coverage is the same as all uges coverage. The reason is that there is only one dupath for each du-pair. ...