软件测试复题及答案.docVIP

复习题 1.Below is one faulty program. It includes a test case that results in failure. Answer the following questions about the program.(20) (a) Identify the fault. (b) If possible, identify a test case that does not execute the fault. (c) If possible, identify a test case that executes the fault, but does not result in an error state. (d) If possible identify a test case that results in an error, but not a failure. Hint: Dont forget about the program counter. (e) For the given test case, identify the first error state. Be sure to describe the complete state. (f) Fix the fault and verify that the given test now produces the expected output. (a) The for-loop should search high to low: for (int i=x.length-1; i = 0; i--) (b) All inputs execute the fault - even the null input. (c) If the loop is not executed at all, there is no error. If the loop is executed only once, high-to-low and low-to-high evaluation are the same. Hence there is no error for length 0 or length 1 inputs. Input: x = [3] Expected Output: -1 Actual Output: -1 (d) There is an error anytime the loop is executed more than once, since the values of index i ascend instead of descend. Input: x = [1, 0, 3] Expected Output: 1 Actual Output: 1 (e) The first error state is when index i has the value 0 when it should have a value at the end of the array, namely x.length-1. Hence, the first error state is encountered immediately after the assignment to i in the for-statement if there is more than one value in x. Input: x = [0, 1, 0] Expected Output: 2 Actual Output: 0 First Error x = [0, 1, 0] i = 0 PC = just after i= 0; (f ) See (a) 4. Answer questions (a)~(d) for the graph defined by the following sets: ?? N = {1, 2, 3, 4}，N0 = {1}，Nf = {4}，E = {(1, 2), (2, 3), (3, 2), (2, 4)} (a) Draw the graph. (b) List test paths that achieve node coverage, but not edge coverage. (c) List test paths that achieve edge coverage, but not edge Pair coverage. (d) List test paths that achieve edge pair coverage. (a)Omitted. (b) Fo