The IIT Madras BS Software Testing (Software Testing) Quiz 1 paper sat on 25 Feb 2024, in the January 2024 term, set 3: 22 questions for 104 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.
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : SOFTWARE TESTING (COMPUTER BASED EXAM)" ARE YOU SURE YOU HAVE TO WRITE EXAM FOR THIS SUBJECT? CROSS CHECK YOUR HALL TICKET TO CONFIRM THE SUBJECTS TO BE WRITTEN. (IF IT IS NOT THE CORRECT SUBJECT, PLS CHECK THE SECTION AT THE TOP FOR THE SUBJECTS REGISTERED BY YOU)
YES
NO
Correct answer
YES
Which of the following approaches to integration testing does not require scaffolding?
Top-down
Bottom-up
Sandwich
Big bang
Correct answer
Big bang
Consider an organization whose purpose of testing is to show the correctness of the software. Identify the process maturity based on the test goal of the organization.
Level 0
Level 1
Level 2
Level 3
Correct answer
Level 1
Match the following based on different levels of testing.
Match the following based on different levels of testing.
A-4, B-1, C-3, D-2
A-4, B-3, C-2, D-1
A-2, B-1, C-3, D-4
A-2, B-3, C-4, D-1
Correct answer
A-2, B-3, C-4, D-1
Consider the control flow graph (CFG) below.
Consider the control flow graph (CFG) below. From the following code segments identify the one that is best presented by the given CFG.
Correct answer
Consider the code below.
Consider the code below. Identify the appropriate condition such that the execution will reach the error statement in LINE-1.
(x 5) && (y < 0)
(x < y) && (x < 5) && (y <= 0)
(x < y) && (x < 4) && (y < 1)
(x < y) && (x < 4) && (y <= 1)
Correct answer
(x < y) && (x < 4) && (y < 1)
Consider the prime path [1, 2, 4] and a path P = [1, 2, 3, 2, 4, 2, 3, 4]. From among the given options, identify the path with a detour but not a sidetrip.
[1, 2, 4]
[1, 2, 3, 2, 4]
[1, 2, 3, 4]
[1, 2, 4, 2, 4]
Correct answer
[1, 2, 3, 4]
Consider the following classes for the code base to be tested and the test class.
Consider the following classes for the code base to be tested and the test class.
Consider the following classes for the code base to be tested and the test class. Identify the test case method that will fail for the given code base.
testcase1()
testcase2()
testcase3()
testcase4()
Correct answer
testcase4()
Consider the finite state machine (FSM) as given below.
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 even number of 0s and odd number of 1s.
Which of the following is/are represented by the nodes in graph models for integration testing?
Modules
Interfaces
Test stubs
Test Drivers
Correct answers
Modules
Test stubs
Test Drivers
Consider the CFG given below.
Consider the CFG given below. From the following options, identify all the valid test paths.
[1, 2, 3, 5, 6, 1]
[1, 2, 3, 5, 2, 4, 5, 6]
[1, 2, 3, 5, 2, 3, 5, 6, 1, 2, 3, 5, 6]
[1, 2, 3, 4, 5, 6, 1, 2, 5, 6]
Correct answers
[1, 2, 3, 5, 2, 4, 5, 6]
[1, 2, 3, 5, 2, 3, 5, 6, 1, 2, 3, 5, 6]
Which of the following conditions is/are required to be satisfied such that a path can be considered as a chain (to define DD-path) in a CFG?
Initial and terminal vertices are distinct.
Any one interior vertices should have out-degree as 2.
All the interior vertices have both in-degree and out-degree as 1.
All the interior vertices have both in-degree and out-degree as ≥1.
Correct answers
Initial and terminal vertices are distinct.
All the interior vertices have both in-degree and out-degree as 1.
Which of the following statements is/are true?
Prime path coverage subsumes all du-paths coverage.
Edge-pair coverage subsumes prime path coverage.
Node coverage subsumes edge coverage.
Edge-pair coverage subsumes edge coverage.
Correct answers
Prime path coverage subsumes all du-paths coverage.
Edge-pair coverage subsumes edge coverage.
Based on the above data, answer the given subquestions.
What are the minimum number of test cases to be prepared for node coverage and edge coverage?
It is 1 for both node coverage and edge coverage.
It is 1 for node coverage, and 3 for edge coverage.
It is 3 for both node coverage and edge coverage.
It is 2 for node coverage, and 3 for edge coverage.
Correct answer
It is 1 for node coverage, and 3 for edge coverage.
Based on the above data, answer the given subquestions.
What is the cyclomatic complexity of the given CFG?
3
4
5
6
Correct answer
4
Consider the CFG given below.
Consider the CFG given below. Based on the above data, answer the given subquestions.
Find the number of test requirements for prime path coverage.
5
6
7
8
Correct answer
7
Consider the CFG given below.
Consider the CFG given below. Based on the above data, answer the given subquestions.
Identify the correct set of test paths for prime path coverage.
{[1, 6], [1, 2, 5, 6], [1, 2, 3, 4, 3, 4, 3, 5, 6]}
{[1, 6], [1, 2, 3, 4, 3, 5, 6]}
{[1, 6], [1, 2, 5, 6], [1, 2, 3, 5, 6], [1, 2, 3, 4, 3, 5, 6]}
{[1, 6], [1, 2, 5, 6], [1, 2, 3, 5, 6], [1, 2, 3, 4, 3, 4, 3, 5, 6]}
Correct answer
{[1, 6], [1, 2, 5, 6], [1, 2, 3, 5, 6], [1, 2, 3, 4, 3, 4, 3, 5, 6]}
Consider the annotated control flow graph (CFG) given below.
Consider the annotated control flow graph (CFG) given below. Based on the above data, answer the given subquestions.
How many du-pairs are there for the variable b?
4
6
8
12
Correct answer
6
Consider the annotated control flow graph (CFG) given below.
Consider the annotated control flow graph (CFG) given below. Based on the above data, answer the given subquestions.
How many unique du-paths are there for the variable b?
4
5
6
7
Correct answer
4
Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
Consider the CFG given below.
Consider the CFG given below. Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
Consider the annotated control flow graph (CFG) given below.
Consider the annotated control flow graph (CFG) given below. Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
