Answer questions a–g for the graph defined by the following sets:N = {1, 2, 3, 4, 5, 6, 7}N0 = {1}Nf = {7}E = {(1, 2), (1, 7), (2, 3), (2, 4), (3, 2), (4, 5), (4, 6), (5, 6), (6, 1)}Also consider the following (candidate) test paths:p1 = [1, 2, 4, 5, 6, 1, 7]p2 = [1, 2, 3, 2, 4, 6, 1, 7]p3 = [1, 2, 3, 2, 4, 5, 6, 1, 7](a) Draw the graph.(b) List the test requirements for Edge-Pair Coverage. (Hint: Youshould get 12 requirements of length 2.)(c) Does the given set of test paths satisfy Edge-Pair Coverage? Ifnot, state what is missing.(d) Consider the simple path [3, 2, 4, 5, 6] and test path [1, 2, 3, 2,4, 6, 1, 2, 4, 5, 6, 1, 7]. Does the test path tour the simple pathdirectly? With a sidetrip? If so, write down the sidetrip.(e) List the test requirements for Node Coverage, Edge Coverage,and Prime Path Coverage on the graph.(f) List test paths from the given set that achieve Node Coveragebut not Edge Coverage on the graph.(g) List test paths from the given set that achieve Edge Coveragebut not Prime Path Coverage on 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
icon
Related questions
Question

Answer questions a–g for the graph defined by the following sets:
N = {1, 2, 3, 4, 5, 6, 7}
N0 = {1}
Nf = {7}
E = {(1, 2), (1, 7), (2, 3), (2, 4), (3, 2), (4, 5), (4, 6), (5, 6), (6, 1)}
Also consider the following (candidate) test paths:
p1 = [1, 2, 4, 5, 6, 1, 7]
p2 = [1, 2, 3, 2, 4, 6, 1, 7]
p3 = [1, 2, 3, 2, 4, 5, 6, 1, 7]
(a) Draw the graph.
(b) List the test requirements for Edge-Pair Coverage. (Hint: You
should get 12 requirements of length 2.)
(c) Does the given set of test paths satisfy Edge-Pair Coverage? If
not, state what is missing.
(d) Consider the simple path [3, 2, 4, 5, 6] and test path [1, 2, 3, 2,
4, 6, 1, 2, 4, 5, 6, 1, 7]. Does the test path tour the simple path
directly? With a sidetrip? If so, write down the sidetrip.
(e) List the test requirements for Node Coverage, Edge Coverage,
and Prime Path Coverage on the graph.
(f) List test paths from the given set that achieve Node Coverage
but not Edge Coverage on the graph.
(g) List test paths from the given set that achieve Edge Coverage
but not Prime Path Coverage on the graph

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Binomial Heap
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education