NPTEL Software Engineering Week 12 Assignment Answers

NPTEL Software Engineering Week 12 Assignment Answers:- In this post, we have provided the answers to the NPTEL Software Engineering Week 12. All the answers are provided here on the basis of data available on the internet.

NPTEL Software Engineering All Week Assignment Answers
Software Engineering Week 1 Answer
Software Engineering Week 2 Answer
Software Engineering Week 3 Answer
Software Engineering Week 4 Answer
Software Engineering Week 5 Answer
Software Engineering Week 6 Answer
Software Engineering Week 7 Answer
Software Engineering Week 8 Answer
Software Engineering Week 9 Answer
Software Engineering Week 10 Answer
Software Engineering Week 11 Answer
Software Engineering Week 12 Answer

NPTEL Software Engineering Week 12 Assignment Answers 2022

Q1. Which one of the following correlates well with the testing difficulty of a program?

  • a. Number of statements in the program
  • b. Number of decision statements in the program
  • c. Complexity of the arithmetic expressions used in the program
  • d. Time complexity of the program
  • e. Number of looping statements present in the program
  • f. Number of arithmetic operators used in the program
Answer:- b

Q2. If two code segments have Cyclomatic complexities of N1 and N2 respectively, what will be the Cyclomatic complexity of the juxtaposition of the two code segments?

  • a. N1+N2
  • b. N1+N2+1
  • C. N1+N2-1
  • d. N1+N2+2
  • e. N1 N2
Answer:- c

Q3. Which one of the following is a fault-based testing technique?

  • a. Pair wise testing
  • b. Dataflow testing Path testing
  • C. Path testing
  • d. Mutation testing
  • e. Boundary value testing
Answer:- d

Q4. Which of the following subsumption relations among white-box test coverage criteria are incorrect?

  • a. Multiple condition coverage subsumes decision coverage
  • b. Basic condition coverage subsumes decision coverage
  • C. Basic condition coverage subsumes statement coverage
  • d. Path coverage subsumes MC/DC
  • e. Modified Condition/ Decision Coverage (MC/DC) subsumes basic condition coverage
Answer:- b, d

Q5. Which of the following are NOT true of white box code coverage?

  • a. Code coverage increases as more and more test cases are designed and exercised.
  • b. 100% code coverage is achieved when all the test cases have been exercised.
  • C. 100% faults in a program are detected when full code coverage is achieved.
  • d. Test completion criteria are often specified in terms of code coverage criteria.
  • e. As the code coverage increases, the number of test case failure increases.
Answer:- b, c

Q6. Why is the all path testing strategy rarely used in practice?

  • a. Too many test cases are required to be executed
  • b. Too weak a testing technique
  • c. It is subsumed by basis path testing
  • d. It is subsumed by statement coverage
  • e. It subsumes statement coverage
Answer:- a

Q7. If MC/DC coverage has been achieved on a unit under test, which of the following test coverage are implicitly implied?

  • a. Basis path coverage
  • b. Decision coverage
  • C. Multiple condition coverage
  • d. Condition/decision coverage
  • e. Data flow coverage
Answer:- b, d

Q8. Which of the following are true of the “competent programmer hypothesis”, as used in the mutation testing literature?

  • a. Mutants corresponding to only simple programming bugs need to be generated as competent programmers make only simple mistakes.
  • b. Mutants corresponding to only unusual programming bugs need to be generated as competent programmers rarely make simple mistakes.
  • C. Mutants corresponding to complex algorithmic bugs need to be generated during mutation testing, when the developing team consists of competent programmers,
  • d. Mutation testing can be meaningfully carried out only for programs developed by competent programmers
  • e. Mutation testing can be meaningfully carried out only for programs developed by rather novice and incompetent programmers
Answer:- a, d

Q9. At least how many test cases are required to achieve MC/DC coverage of the following code segment:

IF(5) or (y«100) or ( z500)) x=x*1;

  • a. 1
  • b. 2
  • C. 3
  • d. 4
  • e. 5
Answer:- d

Q10. What is the McCabe’s Cyclomatic complexity for the following code segment?

  • a. 2
  • b. 3
  • c. 4
  • d. 5
  • e. 6
Answer:- b

Important Links:-

NPTEL Answers

Join Our Telegram

NPTEL Software Engineering Week 12 Assignment Answers:- In this post, we have provided the answers to the NPTEL Software Engineering Week 12. All the answers are provided here on the basis of data available on the internet.

Leave a Comment