1. Equivalence Partitioning

Question:

A machine is designed to accept scores from two indpendent markers. Each script should have 4 marks, each out of 25, and a total for the script. The two markers scores are compared, differences greater than 3 or a total difference of 10 overall is flagged for further scrutiny.

Define a set of partitions for 100% coverage of partitions?

Does anyone have any idea what the answer to this would be?

2. Re: Equivalence Partitioning

Yes, I have an idea. But it looks like homework so I'm not going to give you the answer.

Why don't you tell us what you think the answer is and we can give you pointers if you get it wrong?

3. Re: Equivalence Partitioning

Haha ... It is not actually homework it is just a question from a past exam paper, I am doing revision. I understand how to do this when there is a single scenario - for example a function that takes in months, the values are 1-12, so there are 3 partitions:

Valid - &gt;=1 and &lt;=12
Invalid &lt;=0 and &gt;=13

What is confusing me with this one is the fact that there are 2 markers and then the difference of 3?

Thanks,

4. Re: Equivalence Partitioning

You can have a difference of 3 if the first has 0 marker and second has 3 marks
so in this case the valid conditions should be
&gt;= 3 and &lt;=16.
It also test for total difference on 10.

5. Re: Equivalence Partitioning

OK, well you understand EP. You just need to apply the same logic to the differences.

The two markers are giving each section a score which also creates a total score. So the marks for one test might be:

Marker 1:
§1 25
§2 21
§3 13
§4 20
Total 79

Marker 2:
§1 28
§2 22
§3 15
§4 25
Total 90

Here §4 has a difference of 5 and total has a difference of 11 which would be flagged for scrutiny.

So you just need to write partitions that would cover the different outcomes in differences. You would need two partitions for both the section and total scores.

6. Re: Equivalence Partitioning

[ QUOTE ]
You can have a difference of 3 if the first has 0 marker and second has 3 marks
so in this case the valid conditions should be
&gt;= 3 and &lt;=16.
It also test for total difference on 10.

[/ QUOTE ]

Well, no because the first mark might be 4 and the second might be 12. There's a difference of 8 which should be flagged for scrutiny but they will still fall between 3 and 16 so your EP would see that as valid.

I think the problem looks difficult because it's about comparing values we don't know in advance. So instead we should be doing EP on the difference instead. For example "if the difference is more than 3"...

Hope this helps.

By the way, which cert is this for?

7. Re: Equivalence Partitioning

Thank for very helpful!!, this is for an Information Technology Degree.

8. Re: Equivalence Partitioning

let me give a try:

valid:
case 1: at least 1 dif &gt;3 and Ttl dif &gt;10 flagged
case 2: at least 1 dif &gt;3 and Ttl dif &lt;=10 flagged
case 3: all dif &lt;= 3 and Ttl dif &gt;10 flagged

invalid:
case 4: all dif &lt;=3 and Ttl dif &lt;=10 not flagged

9. Re: Equivalence Partitioning

Looks spot on, elyhe. I was thinking of testing the total and section differences separately but that wouldn't be a true test of 100% of the outcomes.

10. Re: Equivalence Partitioning

[ QUOTE ]
example a function that takes in months, the values are 1-12, so there are 3 partitions:

Valid - &gt;=1 and &lt;=12
Invalid &lt;=0 and &gt;=13

[/ QUOTE ]

Sorry, but your solution in this example is too simplistic esp. since there is no context!!!

You neglected to use the 2 of the 4 heuristics for identifying equivalent partitions. Unique values would be February and Groups would be 30 day months and 31 day months.

Broadly lumping ranges of values without understanding how values within a range could be handled differently is a recipe for disaster.

Page 1 of 2 12 Last

Posting Permissions

• You may not post new threads
• You may not post replies
• You may not post attachments
• You may not edit your posts
•

vBulletin Optimisation provided by vB Optimise v2.6.0 Beta 4 (Pro) - vBulletin Mods & Addons Copyright © 2016 DragonByte Technologies Ltd.