Question 1
Which of the following graph coverage criteria is equivalent to state coverage on a finite state machine (FSM)?
Node coverage
Prime path coverage
Edge coverage
Edge-pair coverage

The IIT Madras BS Software Testing (Software Testing) Quiz 2 paper sat on 3 Aug 2025, in the May 2025 term: 19 questions for 100 marks in 120 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.
Which of the following graph coverage criteria is equivalent to state coverage on a finite state machine (FSM)?
Node coverage
Prime path coverage
Edge coverage
Edge-pair coverage
Correct answer
Node coverage
Correct answer
An organization is building an e-commerce website for a retailer which sells consumer electronic devices such as laptops and smartphones. Customers (users) can place an order by making an online payment. One of the requirements of the system is that the store manager should be able to download monthly sales report from the system. Which type of requirement is this?
Usability requirement
Business requirement
Non-functional requirement
Regulatory requirement
Correct answer
Business requirement
1-A, 2-C, 3-B
1-A, 2-B, 3-C
1-B, 2-A, 3-C
1-B, 2-C, 3-A
Correct answer
1-B, 2-A, 3-C
{0, 30, 40, 120}
{0, 30, 40, 120, 125}
{30, 40}
{−3, 0, 30, 40, 120, 125}
Correct answer
{−3, 0, 30, 40, 120, 125}
In integration testing, top-down approach requires the use of which of the following placeholder components?
Test drivers
Test stubs
Both test drivers and test stubs
It does not require placeholder components
Correct answer
Test stubs
8
9
10
7
Correct answer
7
Consider a program that computes tuition fee waiver for a postgraduate program based on a student’s CGPA according to the following rules:
• If CGPA is 4.0 to 7.9, 0% fee is waived.
• If CGPA is 8.0 to 8.4, 25% fee is waived.
• If CGPA is 8.5 to 8.9, 50% fee is waived.
• If CGPA is 9.0 to 9.4, 75% fee is waived.
• If CGPA is 9.5 to 10.0, 100% fee is waived.
Assume that the CGPA is rounded upto one decimal place. How many equivalence class partitions can be identified in this scenario?
5
6
7
8
Correct answer
7
Correct answer
The predicate is in CNF
The predicate has three conjunctions.
The predicate is in DNF
The predicate has one disjunction.
Correct answers
The predicate has three conjunctions.
The predicate is in DNF
Based on the above data, answer the given subquestions.
Considering the row numbers (#) given in the truth table, which of the following is a RACC pair for the clause b.
(2, 4)
(2, 5)
(4, 6)
(3, 8)
Correct answer
(2, 4)
Based on the above data, answer the given subquestions.
Considering the row numbers (#) given in the truth table, which of the following is a GICC pair for the clause b.
Correct answer
Based on the above data, answer the given subquestions.
Considering the row numbers (#) given in the truth table, identify all RICC pairs for the clause b.
Correct answer
Based on the above data, answer the given subquestions.
How many linearly independent paths are there in G?
6
3
4
5
Correct answer
3
Based on the above data, answer the given subquestions.
How many test requirements are there for edge-pair coverage on G?
11
9
8
6
Correct answer
8
Based on the above data, answer the given subquestions.
What is the minimum number of test paths to acheive edge coverage on G?
1
2
3
4
Correct answer
2
Correct answer
Correct answer
Correct answer