Task $1$ Black Box Testing $(10$ marks$)$

Given the function specification as below, can you design test cases by applying each of the following black box testing methods?

$$ Input Partitioning $(4$ marks$)$

$$ Output Partitioning $(3$ marks$)$

$$ Boundary Value Robustness Testing $(3$ marks$)$

Marking criteria for task $1$ is:

Criteria Ratings Pts

Input Partitioning $4$ Pts

Full marks

Test cases do not miss any important input partition; Test cases do not include redundant input partitions. $0$ Pts

No marks

Each missing or redundant input partition $($or relevant test case$)$ causes a loss of $1$ mark.

$4$ pts

Output Partitioning $3$ Pts

Full marks

Test cases do not miss any important output partition; Test cases do not include redundant output partitions. $0$ Pts

No marks

Each missing or redundant output partition $($or relevant test case$)$ causes a loss of $1$ mark.

$3$ pts

Boundary Value Robustness Testing $3$ Pts

Full marks

Test cases do not miss any important boundary value; Test cases do not include redundant boundary values. $0$ Pts

No marks

Each missing or redundant boundary value $($or relevant test case$)$ causes a loss of $1$ mark.

$3$ pts Use the template provided in the images of the question. Task $1$ Black Box Testing $(10$ marks$)$

Given the function specification as below, can you design test cases by applying each of the following black box testing methods?

Input Partitioning $(4$ marks$)$

Output Partitioning $(3$ marks$)$

Boundary Value Robustness Testing $(3$ marks$)$

Given an array of no more than $100$ unique integers sorted in ascending order, arr, and an integer $x,$ the function returns an integer that meets the following conditions:

If there is no such a value of $j$ that arr$[$j$]$ equals $x,$ then return $-1.$

Otherwise, return the value of $j$ that arr$[$j$]$ equals $x.$

The function throws an Exception for any invalid input, e$.$g$.,$ arr is null, or x is not an integer.

Marking criteria for task $1$ is:

$\backslash$table$[[$Criteria$,$Ratings,Pts$],[\backslash$table$[[$Input$],[$Partitioning$]],,,4$ pts$],[\backslash$table$[[4$ Pts$],[$Full marks$],[$Test cases do not miss any important$],[$input partition; Test cases do not$],[$include redundant input partitions.$]],\backslash$table$[[0$ Pts$],[$No marks$],[$Each missing or redundant input$],[$partition $($or relevant test case$)],[$causes a loss of $1$ mark.$]]],[\backslash$table$[[$Output$],[$Partitioning$]],,,3$ pts$],[\backslash$table$[[3$ Pts$],[$Full marks$],[$Test cases do not miss any important$],[$output partition; Test cases do not$],[$include redundant output partitions.$]],\backslash$table$[[0$ Pts$],[$No marks$],[$Each missing or redundant output$],[$partition $($or relevant test case$)],[$causes a loss of $1$ mark.$]]],[\backslash$table$[[$Boundary$],[$Value$],[$Robustness$],[$Testing$]],,,3$ pts$],[3$ Pts$,0$ Pts$],[$Full marks,No marks$],[\backslash$table$[[$Test cases do not miss any important$],[$boundary value; Test cases do not$],[$include redundant boundary values.$]],\backslash$table$[[$Each missing or redundant$],[$boundary value $($or relevant test$],[$case$)$ causes a loss of $1$ mark.$]]]]$

Complete task $1$ using the following template: Input Partitioning

List all the combinations of the equivalence classes for input parameters $($arr and x $)$:

$\backslash$table$[[$Partition$,$Equivalence Class for arr,Equivalence Class for x$],[$P$1,,],[$P$2,,],[$dots$,,],[,,],[,,],[,,],[,,],[,,],[,,]]$

List the test cases you designed to cover all the identified partitions. Test cases might be fewer than the partitions.

$\backslash$table$[[$Test$,$Partitions covered,arr input,x input,output$],[$T$1,$P$1,,,],[$T$2,$P$2,$ P$3,,,],[$dots$,,,,],[,,,,],[,,,,],[,,,,],[,,,,],[,,,,],[,,,,]]$ Output Partitioning

List all the partitions, i$.$e$.,$ equivalence classes for the output domain.

$\begin{array}{cc}\text{P}\text{a}\text{r}\text{t}\text{i}\text{t}\text{i}\text{o}\text{n}& \text{E}\text{q}\text{u}\text{i}\text{v}\text{a}\text{l}\text{e}\text{n}\text{c}\text{e}\text{C}\text{l}\text{a}\text{s}\text{s}\text{f}\text{o}\text{r}\text{o}\text{u}\text{t}\text{p}\text{u}\text{t}\\ P1& ?\\ P2& ?\\ \text{d}\text{o}\text{t}\text{s}& ?\\ ?& ?\\ ?& ?\\ ?& ?\\ ?& ?\\ ?& ?\\ ?& ?\end{array}$

List the test cases you designed to cover all the identified partitions. The test cases might be fewer than the partitions.

$\backslash$table$[[$Test$,$Partitions covered,arr input,x input,output$],[$T$1,$P$1,,,],[$T$2,$P$2,$ P$3,,,],[$dots$,,,,],[,,,,],[,,,,],[,,,,],[,,,,],[,,,,],[,,,,]]$ Boundary Value Robustness Testing

Test cases designed based on all combinations of boundary values for arr and $x.$

$\backslash$table$[[$Test$,$arr input,x input,output$],[$T$1,,,],[$T$2,,,],[$dots$,,,],[,,,],[,,,],[,,,],[,,,],[,,,],[,,,],[,,,]]$Boundary Value Robustness Testing

Test cases designed based on all combinations of boundary values for arr and $x.$

$\backslash$table$[[$Test$,$arr input,x input,output$],[$T$1,,,],[$T$2,,,],[$dots$,,,],[,,,],[,,,],[,,,],[,,,],[,,,],[,,,],[,,,]]$