Answered: Answer questions a–d for the graph…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Answer questions a–d for the graph defined by the following sets:
N = {1, 2, 3}
N0 = {1}
Nf = {3}
E = {(1, 2), (1, 3), (2, 1), (2, 3), (3, 1)}
Also consider the following (candidate) paths:
p1 = [1, 2, 3, 1]
p2 = [1, 3, 1, 2, 3]
p3 = [1, 2, 3, 1, 2, 1, 3]
p4 = [2, 3, 1, 3]
p5 = [1, 2, 3, 2, 3]
(a) Which of the listed paths are test paths? For any path that is not
a test path, explain why not.
(b) List the eight test requirements for Edge-Pair Coverage (only
the length two subpaths).
(c) Does the set of test paths from part (a) above satisfy Edge-Pair
Coverage? If not, state what is missing.
(d) Consider the prime path [3, 1, 3] and path p2. Does p2
tour the prime path directly? With a sidetrip?

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions