The IIT Madras BS Software Testing (Software Testing) Quiz 1 paper sat on 16 Jul 2023, in the May 2023 term: 17 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.
Consider the control flow graph (CFG) below.
What are the minimum numbers of test paths are required for node and edge coverage?
Minimum 1 test path for both node and edge coverage.
Minimum 2 test paths for both node and edge coverage.
Minimum 1 test path for node coverage and 2 test paths for edge coverage.
Minimum 2 test path for node coverage and 3 test paths for edge coverage.
Correct answer
Minimum 1 test path for node coverage and 2 test paths for edge coverage.
Match the following.
1-D, 2-A, 3-C, 4-B
1-D, 2-C, 3-A, 4-B
1-B, 2-C, 3-A, 4-D
1-B, 2-A, 3-C, 4-D
Correct answer
1-D, 2-C, 3-A, 4-B
Consider the CFG given below and answer the subquestions.
Find the number of test requirements for edge pair coverage.
9
10
11
12
Correct answer
12
Consider the CFG given below and answer the subquestions.
Find the number of simple paths.
13
25
37
42
Correct answer
42
Consider the CFG given below and answer the subquestions.
Find the number of prime paths.
12
13
14
15
Correct answer
13
1-B, 2-A, 3-C
1-B, 2-C, 3-A
1-C, 2-B, 3-A
1-C, 2-A, 3-B
Correct answer
1-B, 2-C, 3-A
Consider the following control flow graph (CFG).
From the following code segments identify the one that is best presented by the given CFG.
Correct answer
Correct answers
Consider the finite state machine (FSM) as given below.
Identify the statement that correctly describes the given FSM.
It accepts all strings that have odd number of 0s and odd number of 1s.
It accepts all strings that have even number of 0s and even number of 1s.
It accepts all strings that have odd number of 0s and even number of 1s.
It accepts all strings that have even number of 0s and odd number of 1s.
Correct answer
It accepts all strings that have odd number of 0s and even number of 1s.
testcase1()
testcase2()
testcase3()
testcase4()
Correct answer
testcase2()
Consider the CFG given below.
Identify the number of linearly independent paths.
3
4
5
6
Correct answer
4
Correct answer
Identify the statement(s) that are true about graph coverage criteria.
Node coverage subsumes both edge coverage and edge pair coverage.
Prime path coverage subsumes both edge Coverage and all duPaths Coverage.
All duPaths Coverage subsumes both all uses coverage and all defs coverage.
Edge pair coverage subsumes both all uses coverage and all defs coverage.
Correct answers
Prime path coverage subsumes both edge Coverage and all duPaths Coverage.
All duPaths Coverage subsumes both all uses coverage and all defs coverage.
Consider the annotated CFG given below and answer the subquestions.
How many du-pairs are there for the variable z?
8
9
10
11
Correct answer
9
Consider the annotated CFG given below and answer the subquestions.
How many unique du-paths are there for the variable z?
4
5
6
7
Correct answer
5
Which of the following integration testing techniques may use scaffolding?
Top-down
Bottom-up
Sandwich
Big bang
Correct answers
Top-down
Bottom-up
Sandwich
Consider the annotated CFG given below.
Identify the test case input(s) that test the path [s, v, x, y, z].
{a = 10, b = 20, c = 15}
{a = 10, b = 20, c = 30}
{a = 30, b = 20, c = 30}
{a = 30, b = 30, c = 30}
Correct answers
{a = 10, b = 20, c = 30}
{a = 30, b = 30, c = 30}
