Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

a) Draw the graph. b) List all of the du-paths with respect to x. (Note: Include all du-paths, even those that are sub-paths of some

image text in transcribed

a) Draw the graph.

b) 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).

c)For each test path, determine which du-paths that test path tours. For this part of the exercise, you should consider both direct touring and side trips. Hint: A table is a convenient format for describing this relationship.

d)List a minimal test set that satisfies all-defs coverage with respect to x. (Direct tours only.) Use the given test paths.

e) List a minimal test set that satisfies all-uses coverage with respect to x.

Graph IV. N={1, 2, 3, 4, 5, 6} No = {1} E=162). (2,3), (2,6), (3,4), (3,5), (4,5). def(x)= {1, 5} use(x) = {5, 6)// Assume the use of x in 5 pre- cedes the def Test Paths: 11 = [1, 2, 61 12 = [1, 2, 3, 4, 5, 2, 3, 5, 2, 6] 13 = [1, 2, 3, 5, 2, 3, 4, 5, 2.6]

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Object Databases The Essentials

Authors: Mary E. S. Loomis

1st Edition

020156341X, 978-0201563412

More Books

Students also viewed these Databases questions

Question

Add 0 1 0 1 to 0 1 1 0 in binary.

Answered: 1 week ago