Question

Give test cases for a code that finds a power of a number

Guys this would seem to be the most easiest question to all the experienced members of this forum but i being a neophyte can only put up these many test cases.

1.Check both values are inputted correctly or not.

2.Check for trivial case when x=0 then for any value of n it should return 0.

3.when n=0 it should always return 1 whatever x be.

4.check for negative values of x and n.
i)If n is negative then result should be always less than or equal to x.

5.Check first for smaller values of x and n i.e for 2,2 3,4 etc.

6.Now check for larger values of n and x and see the results.

Are these test cases correct and Could anybody help me in adding more test cases.

Answer 1

Using Boundary Value Analysis, I would test a combination of following x and n values (asuming the inputs are integers).

• x: Low(Integer), -3, -1, 0, 1, 3, High(Integer)
• n: Low(Integer), -3, -1, 0, 1, 3, High(Integer)

Resulting in 7×7 possible combinations or 49 testcases.

Boundary value analysis is a software
testing technique in which tests are
designed to include representatives of
boundary values. Values on the edge of
an equivalence partition or at the
smallest value on either side of an
edge. The values could be either input
or output ranges of a software
component. Since these boundaries are
common locations for errors that
result in software faults they are
frequently exercised in test cases.

Testcases

x        n
-1              -1
-1              -3
-1              0
-1              1
-1              3
-1              High(Integer)
-1              Low(Integer)
-3              -1
-3              -3
-3              0
-3              1
-3              3
-3              High(Integer)
-3              Low(Integer)
0               -1
0               -3
0               0
0               1
0               3
0               High(Integer)
0               Low(Integer)
1               -1
1               -3
1               0
1               1
1               3
1               High(Integer)
1               Low(Integer)
3               -1
3               -3
3               0
3               1
3               3
3               High(Integer)
3               Low(Integer)
High(Integer)   -1
High(Integer)   -3
High(Integer)   0
High(Integer)   1
High(Integer)   3
High(Integer)   High(Integer)
High(Integer)   Low(Integer)
Low(Integer)    -1
Low(Integer)    -3
Low(Integer)    0
Low(Integer)    1
Low(Integer)    3
Low(Integer)    High(Integer)
Low(Integer)    Low(Integer)