Are you looking for Software Testing NPTEL Week 5 Assignment Answers? You’ve come to the right place! Access the latest and most accurate solutions for your Week 5 assignment in the Software Testing course. Our detailed answers are designed to help you understand key concepts and excel in your studies. Stay updated with the most recent information and answers by joining our Telegram channel.
1. For a given propositional logic formula, if all possible assignments of true/false values to the atomic propositions make the formula evaluate to true, what is the formula called?
a) The formula is a tautology. b) The formula is a satisfiable formula. c) The formula is a contradiction. d) The formula is invalid.
Answer:a) The formula is a tautology.
2. Consider the propositional logic formula φ=p∨q∨r. Which of the following true or false assignments to p, q, and r make the formula φ evaluate to false? In the options below T represents True and F represents False.
a) p=F, q=T, r=F b) p=T, q=F, r=F c) p=F, q=T, r=T d) p=F, q=F, r=F
Answer: d) p=F, q=F, r=F
3. Which logic coverage criterion tests for all possible assignments of true/false values but can get infeasible due to there being a large number of assignments?
a) Clause coverage b) General active clause coverage c) Correlated active clause coverage d) All combinations coverage
Answer:d) All combinations coverage
4. Which of the following is a correct order of subsumption amongst logic coverage criteria? In the options below, read → as ‘subsumes’.
a) Combinatorial coverage → General inactive clause coverage → Restricted inactive clause coverage b) Combinatorial coverage → General active clause coverage → Restricted inactive clause coverage c) Combinatorial coverage → Correlated active clause coverage → Predicate coverage d) Combinatorial coverage → General active clause coverage → Correlated active clause coverage
Answer:d) Combinatorial coverage → General active clause coverage → Correlated active clause coverage
These are Software Testing NPTEL Week 5 Assignment Answers
5. Consider a predicate p and a clause a in p. When evaluating pa, the conditions under which clause a determines p, if we get a value False, what does this indicate?
a) pa evaluating to False indicates that it is not possible for clause a to determine p. b) pa evaluating to False indicates that clause a always determines p, irrespective of the truth values of the other clauses.
Answer:a) pa evaluating to False indicates that it is not possible for clause a to determine p.
6. What is pa, the conditions under which clause a determines p?
a) pa = a b) pa = b c) pa = True d) pa = False
Answer:c) pa = True
7. What is pb, the conditions under which clause b determines p?
a) pb = a b) pb = b c) pb = True d) pb = False
Answer:c) pb = True
8. State yes or no: CACC pairs for the clauses a and b are the same as GACC pairs.
a) Yes b) No
Answer:b) No
9. State yes or no: RACC pairs for the clauses a and b are the same as CACC pairs.
a) Yes b) No
Answer:b) No
10. State yes or no: RICC tuples for the clauses a and b are not the same as CACC tuples.
