Class Notes (1,100,000)
CA (650,000)
UW (20,000)
CS (1,000)
CS447 (60)
Lin Tan (60)
Lecture 12

CS447 Lecture 12: 12-MidtermReview


Department
Computer Science
Course Code
CS447
Professor
Lin Tan
Lecture
12

This preview shows pages 1-3. to view the full 23 pages of the document.
ECE453/SE465/CS447/ECE653/CS647:
Midterm Review
Lin Tan
February 10, 2016

Only pages 1-3 are available for preview. Some parts have been intentionally blurred.

Software Testing Instructor: Lin Tan
Graph Coverage
You should be able to do the following with graphs:
Define graphs, paths
Create TRs for structural and dataflow criteria
Structural: NC, EC, EPC, PPC, CPC
Dataflow: ADC, AUC, ADUPC
Use the subsumption chart to evaluate test sets
Create graphs from source code
Understand concerns in handling multiple methods
2

Only pages 1-3 are available for preview. Some parts have been intentionally blurred.

Software Testing Instructor: Lin Tan
Strengths and Weaknesses of Graph
Coverage:
Must create graph
Node coverage is usually easy, but cycles make
it hard to get good coverage in general.
Incomplete node or edge coverage point to
deficiencies in a test set.
3
You're Reading a Preview

Unlock to view full version