Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
16 Cards in this Set
- Front
- Back
|
What is acceptance testing? |
Formal testing to determine whther or not the software satisfies the acceptance criteria. |
|
|
Who does acceptance testing? |
Test engineers Customers |
|
|
What are the two levels of acceptance tests and where does each take place? |
Alpha: At production site Beta: At user's site |
|
|
When is the work on a software project over? |
When acceptance testing is completed. |
|
|
What is black box testing? |
Treats system as atomic and covers as much specified behavior as possible. |
|
|
What is white box testing? |
Based on code, examins system internals and covers as much implemented behavior as possible. |
|
|
Name and define the three main types of coverage provided by white box testing with regard to control flow diagrams. |
Statement coverage: Explore every node Branch coverage: Explore every edge Path coverage: Explore every path |
|
|
What are the general criteria rankings? |
Statement coverage < Branch coverage < Basis path coverage < Path coverage < Exhaustive testing |
|
|
Can statement coverage ever find more bugs than branch coverage? |
Yes. |
|
|
What is path coverage good for? |
Finding non-localized bugs. |
|
|
What is a problem with path coverage? |
Theoretically infinite loops introduce an infinite number of paths. |
|
|
How is a basis set created? |
Choose one path and add it to the basis set. Add a path to the basis set with exactly one edge not already covered. Repeat. |
|
|
What is the maximum number of paths in a basis set? |
N + 1, where N is the number of conditionals/loops. |
|
|
What is equivalence partitioning? |
Separating inputs into partitions based on inputs which should be similarly handled. |
|
|
How many equivalence partitions should a test case exercise? |
Exactly one. |
|
|
What is boundary testing? |
Testing on and around the edges of invalid/valid cases. |
