The IIT Madras BS Software Testing (Software Testing) Quiz 2 paper sat on 1 Dec 2024, in the September 2024 term: 18 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 types of blackbox testing is most suitable for handling multiple inputs by considering different combinations of equivalence classes?
Equivalence class partitioning
Boundary value analysis
Decision tables
Random testing
Correct answer
Decision tables
Consider the following annotated CFG.
1-B, 2-A, 3-C
1-B, 2-C, 3-A
1-A, 2-B, 3-C
1-A, 2-C, 3-B
Correct answer
1-B, 2-A, 3-C
Which of the following testing types evaluates the user interface, aesthetics, etc. of a software product?
Stress testing
Performance testing
Usability testing
Regression testing
Correct answer
Usability testing
Match the following from the perspective of different kinds of couplings based on the interfaces.
1-B, 2-C, 3-A, 4-D
1-B, 2-C, 3-D, 4-A
1-A, 2-C, 3-D, 4-B
1-A, 2-D, 3-C, 4-B
Correct answer
1-B, 2-C, 3-D, 4-A
How many test cases are required to achieve predicate coverage over a predicate with n clauses?
Correct answer
Suppose we need to test a program that takes a number of integers as input. The minimum and maximum numbers of integers to be input are 5 and 10 respectively. Identify the correct set of BVA (Boundary Value Analysis) test cases from the following options.
Two test cases: (1) 5 integers as input and (2) 10 integers as input
Three test cases: (1) 5 integers as input, (2) 10 integers as input, and (3) 7 integers as input
Five test cases: (1) 5 integers as input, (2) 10 integers as input, (3) 7 integers as input, (4) 6 integers as input, and (5) 9 integers as input
Five test cases: (1) 5 integers as input, (2) 10 integers as input, (3) 7 integers as input, (4) 4 integers as input, and (5) 11 integers as input
Correct answer
Five test cases: (1) 5 integers as input, (2) 10 integers as input, (3) 7 integers as input, (4) 4 integers as input, and (5) 11 integers as input
Consider input space partitioning (ISP) for a program that computes the scholarship amount to be disbursed to the school students as presented in the table below, consisting of characteristics and blocks.
Consider the base choice given below:
grade = 9.6 attendance = 85% gender = Male
What is the minimum number of tests (including the base choice) required to satisfy base choice coverage (BCC) criterion?
3
6
12
18
Correct answer
6
Correct answer
Consider the method below:
Consider the problem of finding a set of test cases which satisfies RICC for the method compute. Which of the following statements is true?
Please note that the variable t needs to be re-written in terms of inputs in the second predicate to achieve various coverage criteria. We use the predicate x < y to represent t.
We get some feasible pairs when predicate p = (t || z == 0) being true and also when p = (t || z == 0) being false.
We get some feasible pairs when predicate p = (t || z == 0) being true. But no feasible pairs when p = (t || z == 0) being false.
We get some feasible pairs when predicate p = (t || z == 0) being false. But no feasible pairs when p = (t || z == 0) being true.
No feasible pairs when predicate p = (t || z == 0) being true, and also when p = (t || z == 0) being true.
Correct answer
We get some feasible pairs when predicate p = (t || z == 0) being true. But no feasible pairs when p = (t || z == 0) being false.
Consider the CFG given below.
From among the given options, identify the code segment that can be correctly presented by given CFG.
Correct answer
Consider the following code segment.
Based on the above data, answer the given subquestions.
At LINE-1, two instances of symbolic execution are created. Identify the path constraints applicable to those.
Correct answer
Consider the following code segment.
Based on the above data, answer the given subquestions.
Suppose the DART technique is applied for testing the code. Identify the path constraint that represents an equivalence class of input vectors containing all input values that lead to the abort statement at LINE-2.
Correct answer
Consider the following code segment.
Based on the above data, answer the given subquestions.
From among the following, identify the set of concrete test inputs that execute all the instances of symbolic execution.
{(a = 1, b = 2, c = 3), (a = 3, b = 3, c = 3), (a = 1, b = 3, c = 3)}
{(a = 1, b = 2, c = 3), (a = 3, b = 2, c = 1), (a = 1, b = 6, c = 3)}
{(a = 3, b = 2, c = 2), (a = 3, b = 2, c = 3), (a = 1, b = 6, c = 3)}
{(a = 3, b = 2, c = 2), (a = 1, b = 4, c = 3), (a = 1, b = 2, c = 3)}
Correct answer
{(a = 1, b = 2, c = 3), (a = 3, b = 2, c = 1), (a = 1, b = 6, c = 3)}
Based on the above data, answer the given subquestions.
From among the options, identify the one that covers all the CACC pairs for the clause a.
(1,5), (1,6), (2,5), (2,6)
(3,4), (3,8), (7,4), (7,8)
(1,5), (2,6)
(2,4), (5,7)
Correct answer
(1,5), (1,6), (2,5), (2,6)
Based on the above data, answer the given subquestions.
From among the options, identify the one that covers all the RACC pairs for the clause a.
(1,5), (1,6), (2,5), (2,6)
(3,4), (3,8), (7,4), (7,8)
(1,5), (2,6)
(2,4), (5,7)
Correct answer
(1,5), (2,6)
Based on the above data, answer the given subquestions.
What are the minimum numbers of test paths required for node coverage and edge coverage of the given CFG?
One test path for both node coverage and edge coverage.
One test path for node coverage and two test paths for edge coverage.
Two test paths for node coverage and one test path for edge coverage.
Two test paths for both node coverage and edge coverage.
Correct answer
One test path for node coverage and two test paths for edge coverage.
Based on the above data, answer the given subquestions.
How many prime paths are present in the given CFG?
6
7
8
9
Correct answer
9
Based on the above data, answer the given subquestions.
Identify the set of test paths that provides prime path coverage.
{[1,2,3,4,5,4,6], [1,3,4,5,4,5,4,6]}
{[1,2,3,4,5,4,6], [1,3,6], [1,3,4,5,4,5,4,6]}
{[1,2,3,4,5,4,6], [1,2,3,4,6], [1,3,6], [1,3,4,5,4,5,4,6]}
{[1,2,3,4,5,4,6], [1,2,3,4,6], [1,2,3,6], [1,3,4,6], [1,3,6], [1,3,4,5,4,5,4,6]}
Correct answer
{[1,2,3,4,5,4,6], [1,2,3,4,6], [1,2,3,6], [1,3,4,6], [1,3,6], [1,3,4,5,4,5,4,6]}
