can I help me pls QUESTION 1: a) What is an equivalence partitioning test? What

Question

can I help me pls  

QUESTION 1: a) What is an equivalence partitioning test? What is it used for? What are its advantages? Explain in your own sentences in one paragraph b)Show the boundary values and apply the equivalence class partitioning tests for the following scenario. List all the test cases and show the valid and invalid inputs.(Draw a table for the answer) Scenario: Suppose the "luggage weight" software module for airlines that you are testing must allow minimum 1, and maximum 40 kg of luggage. QUESTION 2: a) Explain the McCabe's Cyclomatic Complexity in your own words in a paragraph (What is it, why is it used for, what are the criticisms about it.) b) Calculate the Cyclomatic complexity of the following flow graph in three different ways. Show your way. 4 02 0 10

Explanation / Answer

1 A) Equivalence Partitioning is type of Specification Based Testing Technique orBlack Box Testing Technique is technique is to divide/partition a set of test conditions into groups or sets that can be considered the same or equivalence . used to reduce the total number of test cases to a finite set of testable test cases, still covering maximum requirements.

One test value is picked from each class while testing. This is because we are assuming that all the conditions in one partition will be treated in the same way by the software. If one condition in a partition works, we assume all of the conditions in that partition will work and if one condition fails it is assumed that all others in the partition will fail and there is no point in testing others.

1B ) Test cases for Airline Luggage weight system input box accepting numbers between 1 and 40 using Equivalence Partitioning:

So using equivalence partitioning you have categorized all possible test cases into three classes and that can be (-10, 20 & 50). Test cases with other values from any class should give you the same result.

2A) McCabe's cyclomatic complexity is a software quality metric that measures the number of linearly independent paths through the program quantifies the complexity of a software program.

Metric ensures that programs with high McCabe numbers (e.g. > 10) are likely to be difficult to understand and will have higher probability of containing defects in it. The cyclomatic complexity number also indicates the number of test cases that would have to be written to execute all paths in a program.

Calculating the McCabe Number

Cyclomatic complexity is derived from the control flow graph of a program as follows:

Cyclomatic complexity (CC) = E - N + 2P (Formula)
Where:

P = number of disconnected parts of the flow graph
E = number of edges
N = number of nodes

2B) Cyclomatic complexity og graph (CC) = E - N + 2P

P = 1
E = 11
N = 10

CC = 11-10 + 2*1

CC = 3

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.