Graph Coverage

Question 1

In a _____ box approach, we consider only the requirements or inputs for a test

Answer 1

black

Question 2

In a _____ box approach, we factor in the program implementation to our tests

Answer 2

white

Question 3

Describe statement coverage and branch coverage

Answer 3

Statement coverage: How many statements did the suite test

Branch coverage: How many of the condition outcomes were tested

Question 4

In Control Flow Graphs, what do nodes and edges represent?

Answer 4

Nodes: Program Code
Edges: Execution paths that the program may take

Question 5

What are the 4 types of nodes in a Control Flow Graph? Describe them.

Answer 5

Entry Node: 0 incoming edges
Exit Node: 0 outgoing edges
Decision/Branch Node: >1 outgoing edges
Join Node: >1 incoming edges

Question 6

In Control Flow Graphs, straight line sequences of codes are ______ into basic blocks

Answer 6

grouped

Question 7

Node coverage can be more useful than statement. Why?

Answer 7

We can remove irrelevant information as lines of code will be grouped together and removes double counting

Question 8

In a CFG, statement and branch coverage can be replaced with what?

Answer 8

Node and Edge coverage

Question 9

How do node and edge coverage compare?

Answer 9

Edge coverage tests everything that statement coverage does, as you are testing the edges, rather than the nodes of the graph

Question 10

Is full coverage realistic in practice? Why?

Answer 10

No, because of reachability (syntactic [early returns], semantic [condition never false])

Question 11

In CFG coverage, the ____ taken by each test can matter (the combinations of our conditions matter).

Answer 11

path

Question 12

Is it feasible to test all paths in a CFG? Why?

Answer 12

No, because there can be a graph with many decisions and there can be loops (infinite paths)

Question 13

How do we compromise when we test paths in a CFG? Are these compromises good?

Answer 13

Edge pair coverage: Test paths with length <= 2 (related if statements tend to be grouped)
Specified path coverage: Given a number k, test k paths

Question 14

What is a simple path? What is a prime path?

Answer 14

A path between nodes where no node appears more than once, except maybe for the first and last
A prime path is a simple path that is not a subpath of any other simple path

Question 15

What is the use of a simple path when testing CFGs?

Answer 15

Captures the acyclic behaviors of a program

Question 16

When finding simple paths of a graph, we create a finite set of ways that one _________ of a loop may interact with the next

Answer 16

iterations

Question 17

What do prime paths provide when testing CFGs?

Answer 17

Captures notions of how to bypass a loop or have one iteration of the loop affect the next

Question 18

What is prime path coverage?

Answer 18

Cover all prime paths in a CFG with testing

Question 19

What are the intuition for prime paths?

Answer 19

The way to enter, iterate, and exit a loop

Question 20

Prime path coverage tests are only good for testing _______ loops. What do they miss?

Answer 20

critical

Bugs that happen after a certain number of iterations, miss combinations based in decisions

Question 21

What are the subsumption relationships of all the CFG test coverages?

Answer 21

All
Prime / Edge pair coverage
Edge
Node

Question 22

One test may cover ______ prime paths

Answer 22

multiple