nember th enter [0, 0] need more
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
Related questions
Question
![Inspect the flow in the following diagram. Assume 1 and 3 are decision nodes. Assuming you are
providing minimum test cases for each type of coverage, what are the test cases for 100%
statement coverage, 100% branch coverage and 100% path coverage? Describe the test cases in
terms of set of transitions starting with node (1). For example, a possible test case may be written
as the sequence of transitions:
[1, 4, 3, 4, 3, 5].
Fill in the blanks. Use square brackets as above example answer and the sequence (order) of node
numbers is important. Remember the node numbers are separated by commas. If the answer to a
type of coverage is empty enter [0, 0] (write within square brackets two zeroes separated by
commas). A coverage may need more than one answer. Some may have no answer at all. Some
test cases may overlap, so in case this happens, you may reenter same test case sequence for more
than one coverage type.
Flow Diagram.pdf £
Statement Coverage Answer1 is:
Statement Coverage Answer 2 is:
Branch Coverage Answer1 is:
Branch Coverage Answer2 is:
Path Coverage Answer1 is:
Path Coverage Answer2 is:](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F22d1beb8-cacb-4703-b45a-016abe058449%2Fb19a8af6-bb15-4906-a71e-60ff68f16212%2Fd0zz6sb_processed.png&w=3840&q=75)
Transcribed Image Text:Inspect the flow in the following diagram. Assume 1 and 3 are decision nodes. Assuming you are
providing minimum test cases for each type of coverage, what are the test cases for 100%
statement coverage, 100% branch coverage and 100% path coverage? Describe the test cases in
terms of set of transitions starting with node (1). For example, a possible test case may be written
as the sequence of transitions:
[1, 4, 3, 4, 3, 5].
Fill in the blanks. Use square brackets as above example answer and the sequence (order) of node
numbers is important. Remember the node numbers are separated by commas. If the answer to a
type of coverage is empty enter [0, 0] (write within square brackets two zeroes separated by
commas). A coverage may need more than one answer. Some may have no answer at all. Some
test cases may overlap, so in case this happens, you may reenter same test case sequence for more
than one coverage type.
Flow Diagram.pdf £
Statement Coverage Answer1 is:
Statement Coverage Answer 2 is:
Branch Coverage Answer1 is:
Branch Coverage Answer2 is:
Path Coverage Answer1 is:
Path Coverage Answer2 is:

Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps

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.Recommended textbooks for you

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education