FirstRanker's choice
Code: 9F00502
--- Content provided by FirstRanker.com ---
MCA V Semester Regular & Supplementary Examinations November/December 2016
SOFTWARE TESTING
(For students admitted in 2011, 2012, 2013 & 2014 only)
Time: 3 hours
Max. Marks: 60
--- Content provided by FirstRanker.com ---
Answer any FIVE questions
All questions carry equal marks
-
- 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.
-
- Discuss various flow graph elements with their notations.
- Explain briefly about requirements, features and functionality of bugs.
- What are data-flow anomalies? How data flow testing can explore them?
-
- Discuss in detail about testability of domains.
- Explain various properties related to ugly domains.
--- Content provided by FirstRanker.com ---
-
- What are decision tables? Illustrate the applications of decision tables with example.
- Explain the procedure for specification validation using KV charts.
-
- 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 an algorithm for node reduction.
--- Content provided by FirstRanker.com ---
-
- 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 MCA 5th Sem last 10 year 2010-2020 Previous Question Papers (JNTU Anantapur)
--- Content provided by FirstRanker.com ---