Input partitioning Flashcards

1
Q

Input Domain

A

Contains all possible inputs to that program

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

IDM

A
Input Domain Model:
o	1. Interface-based approach
  	Develops characteristics directly from individual input parameters
  	Simplest application
  	Partially automated
o	2. Functionality-based approach
  	Develops characteristics from behavioural view of the program
  	Harder to develop
  	Better or fewer tests
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q
  • Candidates for characteristics:
A

o Preconditions and postconditions
o Relationships among variables
o Relationship with variables with special values (zero, null, blank)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q
  • Identifying values for input domain
A

o Valid, invalid and special values

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q
  • Two types of constraints
A

o A block from one characteristic cannot be combined with specific block
o A block from one characteristic can ONLY BE combined with a specific block from another characteristics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Each Choice

A

o One Value from each block for each characteristics must be used in at least one test case

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q
  • Pair-Wise
A

o A value from each block for each characteristics must be combined with a value from every block for each other characteristcs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q
  • TSC
A

o Terminal Symbol Coverage
o TR contains each terminal symbol
o Bound by the number of terminal symbols
o Equivalent to NC

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q
  • PDC
A
o	Production Coverage
o	TR contains each production
o	PDC subsumes TSC
o	Bound by the number of productions
o	Equivalent to EC
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q
  • Input grammar Mutation operators
A

o Terminal / Nonterminal replacement
o Terminal and Nonterminal Deletion
o Terminal and Nonterminal Duplication

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Partitioning Domain must satisfy two properties:

A
  1. blocks must be pairwise disjoint (no overlap)

2. together the blocks cover the domain D (complete)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Base choice:

A

one, and only one, base choice is selected for each characteristic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Multiple base choice:

A

With multiple-base choice coverage, at least one of the characteristics has more than one base choice

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

How the base tests are defined in the latter

A

With multiple base choice coverage the base tests are defined using each choice coverage over the base choices.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Define mutation score

A

The percent of mutants killed.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

How is the mutation score related to coverage?

A

They are the same, or to be precise, the mutation score is a refinement of coverage