1. Define path product.

2. What is Structured flow graph?

3. Define FSM and State tables.
4. What is Encoding Bugs?
5. Define State.
6. What is dead State?
7. Write a short note on product of matrices?
8. What is in-degree and out-degree.
9. Define Graph Matrix.
10. What is connection matrix?

11. Explain path product and path sums.

12. Derive maximum path count arithmetic for below flow graph
13. Explain equivalent states with example.
14. Explain about good and bad state graphs
15. Discuss about a) State b) State Graph c) State table.
16. Explain the principle and limitations of state testing.
17. Discuss set of all paths in graph matrices
18. Explain connection matrix with an example.
19. Explain graph matrix with examples
20. Explain cyclomatic complexity with example.

1. Which of the following is not a valid phase of SDLC? ( D )

A) Testing Phase B) Requirement Phase C) Deployment Phase D) Testing closure

2. Functional Testing is a------ ( D )

A) Test design technique B) Test level C) SDLC Model D)Test type

3. What are the different levels of Testing? ( D )

A)Integration testing B)Unit testing C) System testing D) All of the above

4. Sanity testing is a ------? ( B )

A) Test type B) Test Execution Level C)Test Level D) Test design technique

5. Cyclomatic complexity is? ( A )

A) White-box testing B) Black box testing C) Grey box testing D) All of the above

6. The finite state machine is as fundamental to software engineering as Boolean algebra to logic.

7. Transitions are denoted by links that join the states.

8. State graphs don’t represent time-they represent sequence

9. The functional requirements of many programs can be specified by decision tables.

10. Boolean algebra is trivialized by using Karnaugh-Veitch charts.

1. What are path expressions?

2. What is absorption Rule?
3. What are output errors?
4. What is impact of bugs in state testing?
5. Compare time and sequence.
6. What is equivalent states?
7. Write a short note on product of matrices?
8. Mention some characteristics of partial ordered graphs? .
9. What is a relation? And transitive relation?
10. Write about power of matrix?

11. Explain path product and path sums.

12. Derive maximum path count arithmetic for below flow graph.
13. Explain equivalent states with example
14. Explain about good and bad state graphs.
15. Discuss about a) State b) State Graph c) State table
16. Explain the principle and limitations of state testing.
17. Describe partitioning algorithm
18. Explain connection matrix with an example
19. Explain different properties of relations?
20. Discuss about equivalence relation and partial ordering relation.

1. Which of the following is not a valid phase of SDLC? ( D )

A) Testing Phase B) Requirement Phase C) Deployment Phase D) Testing closure
2. Functional Testing is a------ ( D )
A) Test design technique B) Test level C) SDLC Model D)Test type

3. What are the different levels of Testing? ( D )

A)Integration testing B)Unit testing C) System testing D) All of the above

4. Sanity testing is a ------? ( B )

A) Test type B) Test Execution Level C)Test Level D) Test design technique

5. Cyclomatic complexity is? ( A )

A) White-box testing B) Black box testing C) Grey box testing D) All of the above

6. A predicate is implemented as a process whose outcome is a truth-functional value.

7. Every input-state combination must have a specified transition..

8. The strategy for state testing is analogous to that used for path testing flow graphs.

9. A collapsing process which gets the path expression from any node to any other node

10. A graph matrix is a square array with one row and one column for every node in the graph.