Equivalence Class Testing Flashcards

1
Q

What is Boundary Value Testing?

A

Boundary Value Testing is a software testing technique where test cases are designed based on the boundaries of the input domain.

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

What does Boundary Value Testing focus on?

A

Boundary Value Testing focuses on testing the input values that lie on the boundaries of the input domain.

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

What does Boundary Value Testing ignore?

A

Boundary Value Testing ignores the output of the System Under Test (SUT) and only focuses on the input values.

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

How is a test suite generated in Boundary Value Testing?

A

In Boundary Value Testing, a test suite is generated by selecting test cases that are on or near the boundaries of the input domain.

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

In the context of a computational problem with 2 inputs of type byte, what will a Boundary Value Testing test suite do?

A

In the context of a computational problem with 2 inputs of type byte, the Boundary Value Testing test suite will always exercise the SUT for the same inputs, which are on or near the boundaries of the input domain.

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

Boundary Value Testing ignores the output

A

False.

Boundary Value Testing is a technique for designing test cases that focuses on the input domain’s boundaries and aims to test for errors at those boundaries. However, it does not ignore the output. After executing the test cases, the expected output is compared to the actual output to determine whether the SUT behaves correctly.

In the given statement, it is mentioned that the test suite will always exercise the SUT for the same inputs. This is incorrect because the whole idea of test suite design is to provide a variety of inputs to test the SUT thoroughly.

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

What type of analysis is triggered by the output?

A

The analysis triggered by the output is not specified in the given statement.

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

What is the assumption behind equivalence class testing?

A

The assumption is that the SUT will behave the same for certain classes of inputs.

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

Why is it important to cover all possible behaviors in testing?

A

It is important to cover all possible behaviors in testing to ensure that the system is well tested and that all potential issues have been identified.

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

What is the benefit of using equivalence classes in testing?

A

The benefit of using equivalence classes in testing is that it allows for a more efficient and effective way of testing, as it helps to identify and group inputs that are expected to produce similar behavior from the SUT. This allows for more comprehensive testing coverage with fewer test cases.

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

What are some potential drawbacks of using equivalence classes in testing?

A

Some potential drawbacks of using equivalence classes in testing include the risk of missing edge cases and unusual input scenarios that may not fit neatly into established equivalence classes, and the potential for over-reliance on assumptions about the behavior of the SUT based on input classes.

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

What is an equivalence relation?

A

An equivalence relation is a relation between elements of a set that is reflexive, symmetric, and transitive.

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

What does it mean for a relation to be reflexive?

A

A relation is reflexive if every element is related to itself.

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

What does it mean for a relation to be symmetric?

A

A relation is symmetric if, for any two elements a and b, if a is related to b, then b is related to a.

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

What does it mean for a relation to be transitive?

A

A relation is transitive if, for any three elements a, b, and c, if a is related to b and b is related to c, then a is related to c.

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

Can you give an example of an equivalence relation?

A

Yes, the relation of equality is an example of an equivalence relation. For any set of elements, the relation “is equal to” is reflexive, symmetric, and transitive.

17
Q

What is a partition in set theory?

A

A partition in set theory is a collection of non-empty, pairwise disjoint subsets of a given set X whose union is equal to X.

18
Q

What are the two conditions for a set P to be a partition of a set X?

A

The two conditions are:

The union of the elements of P is equal to X, i.e., every element of X belongs to exactly one element of P.
The intersection of any two distinct elements of P is empty, i.e., no two elements of P have any element in common.

19
Q

What is weak normal equivalence class testing?

A

Weak normal equivalence class testing is a testing technique that involves partitioning the entire input domain into equivalence classes.

20
Q

What is the first step in weak normal equivalence class testing?

A

The first step in weak normal equivalence class testing is to define partitions of the entire input domain.

21
Q

What is the second step in weak normal equivalence class testing?

A

The second step in weak normal equivalence class testing is to identify test inputs by randomly choosing one element from each equivalence class.

22
Q

What is the third step in weak normal equivalence class testing?

A

The third step in weak normal equivalence class testing is to determine the expected outputs for each test input according to the computational problem.

23
Q

How are test inputs identified in weak normal equivalence class testing?

A

Test inputs are identified by randomly choosing one element from each equivalence class.