1. Suppose there is a function F with three input variables: a (integer), b (integer) and c (double):
F= (a-b)/c,
where 0<=a<10000, 0<=b<10000 and 0<=c<18.8
Suppose QA specialist Tom has developed the following test cases. Please discuss whether there are any missing test cases based on the basic Boundary Value analysis technique (not considering robustness or worst cases). If yes, please add the missing test case(s). Otherwise, just state that the provided test cases are complete. (Note: For double values, assume the smallest increment is 0.1.) [10 marks]
Copyright By PowCoder代写 加微信 powcoder
Test Case a B c F
03 5000 5000
04 9999 5000
06 5000 5000
07 5000 9998
08 5000 9999
09 5000 5000
10 5000 5000
11 5000 5000
12 5000 5000
13 5000 5000
9.4 -531.9 9.4 -531.8 9.4 0.0 9.4 531.8 9.4 531.9 9.4 0.0 9.4 -531.7 9.4 -531.8 0.0 Undefined 1.0 0.0 9.4 0.0
18.7 0.0 18.8 0.0
No, it is not complete (1 marks)
Missing a test case on a = 9998 and an example test case is: (9998, 5000, 9.4, 531.7) .Here, b and c values should be NOT on the boundary. (3 marks)
Missing a test case on b = 1 and an example test case is: (5000, 1, 9.4, 531.8). Here, a and
c values should be NOT on the boundary. (3 marks) For c:
Missing a test case on c=18.6
Missing a test case on c=0.1
Similarly a and b values should NOT be on the boundary. (3 marks)
2. Consider the following navigation graph for an e-commerce system: please estimate the number of paths between the Login and the Exit pages. You need to show your work. [7 marks]
login -> password recovery -> exit
When there is zero back loop
login->account summary -> browse->purchase->exit login->account summary -> search->purchase->exit
When there is one back loop, there are 2 * 2 = 4 ways
When there are two back loops, there are 2*2*2 = 2^3 = 8 , so in total we will have
1 + 2 (no backloop) + 2^2 (one backloop) + … + 2^5 (4 backloop) (5 mark) = 1 + 2 + 4 + 8 + 16 + 32 = 63 paths (5 marks)
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com