# NPTEL Software Testing IIITB Assignment 3 Answers 2023

Hello learners In this article we are going to discuss NPTEL Software Testing IIITB Assignment 3 Answers. All the Answers provided below to help the students as a reference, You must submit your assignment with your own knowledge and use this article as reference only.

For an autonomous agent to behave in an intelligent manner it must be able to solve problems. This means it should be able to arrive at decisions that transform a given situation into a desired or goal situation. The agent should be able to imagine the consequence of its decisions to be able to identify the ones that work. In this first course on AI we study a wide variety of search methods that agents can employ for problem solving.

### NPTEL Software Testing IIITB Assignment 3 Answers 2023:

1. State true or false: In a du-path corresponding to a variable v from a definition of v to a use of v, there can be other definitions of v in between, as long as the paths are simple.

`Answer :- Will update answers soon and update on our telegram channel so Join Click Here`

2. What kind of uses do we consider in a predicate use (p-use) of a variable?

`Answer :- `

3. Which of the following distinguishes all definitions and all uses data flow coverage?

`Answer :- `

4. State yes or no: When we work towards making a data flow coverage criteria feasible and consider side trips, do the side trips have to be def-clear?

`Answer :- `

5. Which of the following represents a correct order of subsumption amongst graph coverage criteria? Note that the answer options below include both structural and data flow coverage criteria, and the symbol → denotes the subsumes relation.

`Answer :- `

For the next five questions, consider the following graph with six nodes numbered 1 to 6, node 1 is the initial node, node 6 is the final node. The graph represents the CFG with definitions and uses of a particular variable x as follows: Nodes 1 and 3 correspond to definitions of x, nodes 3 and 6 corresponds to uses of x. Assume that the use at node 3 precedes the definition at node 3.

6. How many du-paths are there for the variable x?

`Answer :- `

7. Which of the following is a (non-exhaustive) list of du-paths for x?

`Answer :- `

8. Consider the test path t1 = [1, 2, 3, 4, 5, 2, 3, 5, 2, 6]. Which of the following is a list of all the du-paths that t1 tours directly?

`Answer :- `

9. Consider the test path t2 = [1, 2, 6]. State yes or no: There are du-paths that t2 tours directly.