Name of the College : Sphoorthy Engineering College
University : JNTUH
Department : Computer Science And Engineering
Subject Code/Name : 07A50502/SOFTWARE TESTING METHODOLOGIES
Year/Sem : III/I
Website : http://www.sphoorthyengg.ac.in/#/home
Document Type : Model Question Paper
Download Model/Sample Question Paper : https://www.pdfquestion.in/uploads/sphoorthyengg.com/4871-07A50502-SOFTWARETESTINGMETHODOLOGIES.pdf
Sphoorthy Software Testing Methodologies Question Paper
III B.Tech I Semester Examinations,December 2011
Common to Information Technology, Computer Science And Engineering
Time: 3 hours
Max Marks: 80
Related : Sphoorthy Engineering College 09A50504 Computer Forensics B.Tech Question Paper : www.pdfquestion.in/4838.html
Set No.1
Answer any FIVE Questions :
All Questions carry equal marks :
1. (a) What are the advantages of matrix representations?
(b) Write about loops in matrix representation. [8+8]
2. (a) Mention design guidelines for building nite state machines into your code.
(b) Explain with example how to convert a specification into a state graph . And discuss how contradictions can come about. [8+8]
3. Differentiate Nice Domains and Ugly domains. [16]
4. (a) Explain process block, junction, 100% path coverage and Predicate.
(b) How do you ensure 100% node coverage if every process link is covered at least once? [8+8]
5. Write the Boolean algebra rules. [16]
6. (a) Explain the steps for Reduction procedure.
(b) Explain about path sums, distributive laws and absorption rules. [8+8]
7. (a) What are the different data object states in data-flow graphs.
(b) List nine possible two-letter combinations of the object states of data flow anomalies. Classify them as buggy, suspicious and ok. [8+8]
8. (a) What are the Phases in a Tester’s Attitudinal Progression?
(b) Differentiate function Versus Structural Testing. [10+6]
Set No. 2
1. (a) What are the Phases in a Tester’s Attitudinal Progression?
(b) Differentiate function Versus Structural Testing. [10+6]
2. Write the Boolean algebra rules. [16]
3. (a) Explain process block, junction, 100% path coverage and Predicate.
(b) How do you ensure 100% node coverage if every process link is covered at least once? [8+8]
4. (a) Explain the steps for Reduction procedure.
(b) Explain about path sums, distributive laws and absorption rules. [8+8]
5. (a) Mention design guidelines for building nite state machines into your code.
(b) Explain with example how to convert a specification into a state graph . And discuss how contradictions can come about. [8+8]
6. Differentiate Nice Domains and Ugly domains. [16]
7. (a) What are the advantages of matrix representations?
(b) Write about loops in matrix representation. [8+8]
8. (a) What are the different data object states in data-flow graphs.
(b) List nine possible two-letter combinations of the object states of data flow anomalies. Classify them as buggy, suspicious and OK. [8+8]
Set No.3
Software Testing Methodologies :
1. (a) Mention design guidelines for building nite state machines into your code.
(b) Explain with example how to convert a specication into a state graph . And discuss how contradictions can come about. [8+8]
2. (a) What are the Phases in a Tester’s Attitudinal Progression?
(b) Dierentiate function Versus Structural Testing. [10+6]
3. Write the Boolean algebra rules. [16]
4. Dierentiate Nice Domains and Ugly domains. [16]
5. (a) Explain the steps for Reduction procedure.
(b) Explain about path sums, distributive laws and absorption rules. [8+8]
6. (a) Explain process block, junction, 100% path coverage and Predicate.
(b) How do you ensure 100% node coverage if every process link is covered at least once? [8+8]
7. (a) What are the advantages of matrix representations?
(b) Write about loops in matrix representation. [8+8]
8. (a) What are the dierent data object states in data- ow graphs.
(b) List nine possible two-letter combinations of the object states of data ow anomalies. Classify them as buggy, suppicioos and ok. [8+8]
Set No.4
Software Testing Methodologies :
1. (a) What are the advantages of matrix representations?
(b) Write about loops in matrix representation. [8+8]
2. (a) What are the different data object states in data- ow graphs.
(b) List nine possible two-letter combinations of the object states of data ow anomalies. Classify them as buggy, suspicious and ok. [8+8]
3. Didifferentiate Nice Domains and Ugly domains. [16]
4. (a) Mention design guidelines for building nite state machines into your code.
(b) Explain with example how to convert a specication into a state graph . And discuss how contradictions can come about. [8+8]
5. (a) What are the Phases in a Tester’s Attitudinal Progression?
(b) Didifferentiate function Versus Structural Testing.