NPTEL Software Testing Assignment 11 Answer 2022

 

Week 11 : Assignment 11

Due date: 2022-10-12, 23:59 IST.

Assignment not submitted

1 point

State yes or no: Is concolic testing a white-box testing technique?

 Yes.

 No.

1 point

Which of the following is true about concolic testing?

 Concolic testing is used instead of symbolic testing when the latter fails.

 Concolic testing keeps concrete state and symbolic state.

1 point

What is the use of a SAT/SMT solver in symbolic testing?

 SAT/SMT solvers are used to collect path constraints in symbolic testing.

 SAT/SMT solvers are used to solve path constraints and get values that can be used as test inputs.

 Constraint solvers are not useful in symbolic testing as not all path constraints can be collected and solved.

 Constraint solvers on predicates always return true or false values which helps to decide the execution paths.

1 point

State true or false: Symbolic execution can be used to detect non-termination in programs.

 True.

 False.

1 point

Which of the following is a list of techniques used in the algorithm deployed by DART?

 Ramdom testing, symbolic testing and constraint solvers.

 Symbolic testing and automated testing.

 Directed search, random testing and constraint solvers.

 Concrete testing and symbolic testing.

1 point

Which of the following strategy is used for input search in concolic testing?

 Random search.

 Systematic, random search interleaved with path-sensitive search.

Common data for Q7-Q10:

Consider the code fragment given below. Answer the following questions related to symbolic execution of the given code fragment.

0: int x, y;
1: if (x > y) {
2:    x = x + y;
3:    y = x - y;
4:    x = x - y;
5:    if (x - y > 0)
6:      --- error ---;
    }

1 point

What does the code fragment do?

 It checks if x is greater than y.

 It checks if y is greater than x.

 It swaps the values of x and y.

 It swaps the values of x and y twice.

1 point

How many decision points and execution paths are there in the code fragment?

 Two decision points and three execution paths.

 Three decision points and four execution paths.

1 point

What will be the path constraint at line 1 of the code fragment such that program exits without further execution?

 x > y.

 x <= y.

1 point

State yes or no: Is the error statement reachable in the given program fragment?

 Yes.

 No.

Q1.  A

Q2.  B

Q3. C

Q4.  A

Q5. C 

Q6.  B

Q7.  C

Q8.  A

Q9.  B

Q10. B