Code: 9F00502
MCA V Semester Supplementary Examinations May 2018
--- Content provided by FirstRanker.com ---
SOFTWARE TESTING
(For students admitted in 2011(LC), 2012, 2013, 2014 & 2015)
Time: 3 hours Max. Marks: 60
Answer any FIVE questions
All questions carry equal marks
--- Content provided by FirstRanker.com ---
- (a) To what extent can testing be used to validate that the program is fit for its purpose. Discuss.
- State and explain various kinds of predicate blindness with examples.
- What is meant by a loop? State and explain different kinds of loops with suitable examples.
- Explain in detail about the data flow model.
- What is transaction flow testing? Explain.
- Discuss in detail about testability of domains.
- Where does domain come from? Explain nice domains.
- What is the looping probability of a path expression? List out arithmetic rules and explain with examples.
- Elaborate with an example, how to convert a specification into a state graph.
- Explain the rules of Boolean algebra.
- What are the principles of state testing? Explain its advantages and disadvantages.
- Write about testability tips.
- What operations does a toolkit consist for the representation of graph?
- Discuss the relative merits and demerits of different graph matrix representations.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
This download link is referred from the post: JNTUA M.Tech 2nd Sem last 10 year 2010-2020 Previous Question Papers (JNTU Anantapur)
--- Content provided by FirstRanker.com ---