Scribd
Upload
219 views2 pages

STM Q Paper 2-Mid

The document outlines topics and questions for different units in a Software Testing Methodologies course. Unit 5 covers Huang's Theorem, regular expressions, and node reduction procedures. Unit 6 discusses decision tables, expanding immaterial cases, and minimizing functions using Karnaugh maps. Unit 7 is about state testing principles, finite state machines, good and bad state graphs. Unit 8 focuses on node reduction algorithms, matrix representations, loops in matrices, and finding all paths.

Uploaded by

7killers4u
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
219 views2 pages

STM Q Paper 2-Mid

The document outlines topics and questions for different units in a Software Testing Methodologies course. Unit 5 covers Huang's Theorem, regular expressions, and node reduction procedures. Unit 6 discusses decision tables, expanding immaterial cases, and minimizing functions using Karnaugh maps. Unit 7 is about state testing principles, finite state machines, good and bad state graphs. Unit 8 focuses on node reduction algorithms, matrix representations, loops in matrices, and finding all paths.

Uploaded by

7killers4u
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

VIDYA VIKAS INSTITUTE OF TECHNOLOGY Department of computer science Software Testing Methodologies IV-I CSE/IT

UNIT-5
1. Write about Huang's Theorem. Explain its implementation with an example. Ex-Plain its Generalizations and limitations. (279) 2. Explain the usage of regular expression in flow anomaly detection. 3. Write about any two applications of regular expression. (278) 4. Explain the following in the context of node reduction procedure: (a) Cross term step (b) Parallel term step (c) Loop term step. (251) 5. How can the looping probabilities of a path expression can be calculated.

UNIT-6
1. What is a decision table and how does it is useful in testing. Explain it with help of an example. 2. (a) Discuss the role of decision table in a test case design. (b) How can we expand the immaterial cases in the decision table? 3. Minimize the function using Karnaugh Map method F(A,B,C,D)= (1,2,3,8,9,10,11,14)+ d(7,15) 4. Minimize the function:
F(A,B,C,D)= m(0,5,7,8,9,10,11,14,15) 5. using k-maps find the minimized expression.: F(A,B,C,D)= m (0,5,6,8,9,10,11,16,20,24,25,26,27,29,31)

UNIT-7
1. What are the principles of state testing? Explain its advantages and disad-vantages. 2. What is finite state machine and a state? 3. Differentiate between good state graphs and bad state graphs. 4. Write the tester comments about state graph. 5. Design guidelines for building finite state machines into your code.

UNIT-8

1. Write an algorithm for Node Reduction (General). 2. Illustrate the applications of Node Reduction algorithm. 3. What are the advantages of matrix representations? 4. Write about loops in matrix representation. 5 (a) what are the matrix operations in tool building? (b)Discuss the algorithm for finding set of all paths.

You might also like