MauryaHub PYQ Practice

Software Testing · Quiz 2 · Sep 2025

Software Testing · Quiz 2 · Sep 2025

← Course papers · Start practice / exam

Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.

0 / 21 published solutions

Question 25 MCQ · 4.0 marks

Using the COCOMO model and the given cost drivers, what is the final estimated effort (in person- months) for the project?
6406535902751.
22.0 PM
6406535902752.
23.5 PM
6406535902753.
31.6 PM
6406535902754.
35.0 PM

A published solution is not available for this question yet.

Report a correction for Q25

Question 26 MCQ · 4.0 marks

If QWave Solutions wants to complete the project in 4 months, how many full-time developers are required?
6406535902755.
5
6406535902756.
6
6406535902757.
7
6406535902758.
8 **Sw Testing** **Section Id :** 640653121907 **Section Number :** 2 **Section type :** Online **Mandatory or Optional :** Mandatory **Number of Questions :** 14 **Number of Questions to be attempted :** 14 **Section Marks :** 100 **Display Number Panel :** Yes **Section Negative Marks :** 0 **Group All Questions :** No **Enable Mark as Answered Mark for Review and** No **Clear Response :** **Section Maximum Duration :** 0 **Section Minimum Duration :** 0 **Section Time In :** Minutes **Maximum Instruction Time :** 0

A published solution is not available for this question yet.

Report a correction for Q26

Question 28 MCQ · 5.0 marks

Which of the following structural graph coverage criteria subsumes All DU-Paths Coverage on a data flow graph?
6406535902761.
Edge-pair coverage
6406535902762.
Edge coverage
6406535902763.
Prime path coverage
6406535902764.
Node coverage

A published solution is not available for this question yet.

Report a correction for Q28

Question 29 MCQ · 5.0 marks

Consider four partitions with blocks
Source diagram or notation
,
Source diagram or notation
,
Source diagram or notation
, and
Source diagram or notation
.What is the minimum number of tests required to satisfy Each Choice Coverage (ECC) criterion?
6406535902765.
8
6406535902766.
4
6406535902767.
5
6406535902768.
7

A published solution is not available for this question yet.

Report a correction for Q29

Question 30 MCQ · 5.0 marks

Consider the predicate
Source diagram or notation
. Which of the following options represents
Source diagram or notation
, i.e. the conditions under which clause
Source diagram or notation
determines
Source diagram or notation
?
6406535902769.Source diagram or notation
6406535902770.Source diagram or notation
6406535902771.Source diagram or notation
6406535902772.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q30

Question 31 MCQ · 5.0 marks

An organization is developing a mobile application for a food delivery service. One of the features specified is that the user should be able to track their order in real-time on the app. What kind of requirement does this represent?
6406535902773.
User requirement
6406535902774.
Business requirement
6406535902775.
Regulatory requirement
6406535902776.
Non-functional requirement

A published solution is not available for this question yet.

Report a correction for Q31

Question 32 MCQ · 5.0 marks

Consider a system that categorizes job applicants based on their cumulative work experience according to the following categories: • If work experience is between 0 to 1 year, the applicant is categorized as Entry-Level. • If work experience is between 2 to 3 years, the applicant is categorized as Junior. • If work experience is between 4 to 5 years, the applicant is categorized as Mid-Level. • If work experience is 6 years or more, the applicant is categorized as Senior. Assume that work experience is expressed in whole years. How many equivalence class partitions can be identified in this scenario?
6406535902777.
3
6406535902778.
5
6406535902779.
4
6406535902780.
6

A published solution is not available for this question yet.

Report a correction for Q32

Question 33 MCQ · 5.0 marks

Active Clause Coverage (ACC) is equivalent to which of the following classical coverage criteria for source code?
6406535902781.
Branch coverage
6406535902782.
Decision coverage
6406535902783.
Modified condition decision coverage (MCDC)
6406535902784.
Statement coverage

A published solution is not available for this question yet.

Report a correction for Q33

Question 34 MCQ · 5.0 marks

Consider the following range for a product's warranty period.
Source diagram or notation
. Which of the following test inputs would satisfy Boundary Value Analysis (BVA) for the given partition?
6406535902785.Source diagram or notation
6406535902786.Source diagram or notation
6406535902787.Source diagram or notation
6406535902788.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q34

Question 35 MCQ · 5.0 marks

Consider the following code segment for symbolic testing. // Compute the sum of positive integers, return on any negative input. int series(int a) { int sum = a; int i = 0; while(true) { r = sym_input(); if(r < 0) { break; } sum = sum + r; i++; } return sum; } Choose the appropriate path constraint (PC) for the while loop with a sequence of
Source diagram or notation
true outcomes followed by a false. Consider each
Source diagram or notation
as a fresh symbolic value.
6406535902789.Source diagram or notation
6406535902790.Source diagram or notation
6406535902791.Source diagram or notation
6406535902792.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q35

Question 36 MSQ · 5.0 marks

Consider the predicate
Source diagram or notation
. Which of the following options are true?
6406535902793.
The predicate is in CNF.
6406535902794.
There are 2\(^{3}\) possible valuations for this predicate.
6406535902795.
The predicate is in DNF.
6406535902796.
There are 2\(^{6}\) possible valuations for this predicate.

A published solution is not available for this question yet.

Report a correction for Q36

Question 37 MCQ · 5.0 marks

Consider the predicate
Source diagram or notation
and its truth table given below. Note that the blank cells represent the value
Source diagram or notation
in the truth table.
Source diagram or notation
Based on the above data ,answer the given subquestions.
Considering the row numbers (#) given in the truth table, which of the following is a CACC pair for the clause
Source diagram or notation
?
6406535902797.
(2,5)
6406535902798.
(2,6)
6406535902799.
(1,5)
6406535902800.
(1,8)

A published solution is not available for this question yet.

Report a correction for Q37

Question 38 MCQ · 5.0 marks

Consider the predicate
Source diagram or notation
and its truth table given below. Note that the blank cells represent the value
Source diagram or notation
in the truth table.
Source diagram or notation
Based on the above data ,answer the given subquestions.
Considering the row numbers (#) given in the truth table, which of the following is a RICC pair for the clause
Source diagram or notation
?
6406535902801.
(1, 3) for
Source diagram or notation
, no feasible pair for
Source diagram or notation
6406535902802.
(1, 4) for
Source diagram or notation
, no feasible pair for
Source diagram or notation
6406535902803.
(2, 4) for
Source diagram or notation
, no feasible pair for
Source diagram or notation
6406535902804.
(2, 6) for
Source diagram or notation
, no feasible pair for
Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q38

Question 39 MCQ · 5.0 marks

Consider the control flow graph (CFG),
Source diagram or notation
, where • Set of vertices
Source diagram or notation
• Set of edges
Source diagram or notation
• Initial vertex
Source diagram or notation
• Final vertex
Source diagram or notation
Based on the above data, answer the given subquestions.
What is the cyclomatic complexity of
Source diagram or notation
?
6406535902805.
3
6406535902806.
4
6406535902807.
5
6406535902808.
6

A published solution is not available for this question yet.

Report a correction for Q39

Question 40 MCQ · 5.0 marks

Consider the control flow graph (CFG),
Source diagram or notation
, where • Set of vertices
Source diagram or notation
• Set of edges
Source diagram or notation
• Initial vertex
Source diagram or notation
• Final vertex
Source diagram or notation
Based on the above data, answer the given subquestions.
How many test requirements are there for edge-pair coverage on
Source diagram or notation
?
6406535902809.
9
6406535902810.
7
6406535902811.
10
6406535902812.
8

A published solution is not available for this question yet.

Report a correction for Q40

Question 41 MCQ · 5.0 marks

Consider the control flow graph (CFG),
Source diagram or notation
, where • Set of vertices
Source diagram or notation
• Set of edges
Source diagram or notation
• Initial vertex
Source diagram or notation
• Final vertex
Source diagram or notation
Based on the above data, answer the given subquestions.
What is the minimum number of test paths needed to achieve edge coverage on
Source diagram or notation
.
6406535902813.
1
6406535902814.
2
6406535902815.
3
6406535902816.
4

A published solution is not available for this question yet.

Report a correction for Q41

Question 42 MCQ · 5.0 marks

Consider the following data flow graph and answer the subsequent questions.
Source diagram or notation
How many test requirements are there to satisfy All-Defs Coverage for variable x?
6406535902817.
3
6406535902818.
1
6406535902819.
2
6406535902820.
4

A published solution is not available for this question yet.

Report a correction for Q42

Question 43 MCQ · 5.0 marks

Consider the following data flow graph and answer the subsequent questions.
Source diagram or notation
How many test requirements are there to satisfy All-Uses Coverage for variable x?
6406535902821.
5
6406535902822.
6
6406535902823.
7
6406535902824.
4

A published solution is not available for this question yet.

Report a correction for Q43

Question 44 MCQ · 5.0 marks

Consider the following data flow graph and answer the subsequent questions.
Source diagram or notation
Which of the following is not a def-clear path for variable x?
6406535902825.Source diagram or notation
6406535902826.Source diagram or notation
6406535902827.Source diagram or notation
6406535902828.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q44

Question 45 MCQ · 5.0 marks

Consider that concolic testing technique (DART) is used to test the following code segment. int mean(int a, int b){ return (a + b)/2; } int square(int n) { return n * n; } int process(int a, int b) { int t1 = mean(a, b); int t2 = square(t1) - (a * b) if(t2 <= 0) { // LINE-1 abort(); // LINE-2 } return t2; } Assume that
Source diagram or notation
and
Source diagram or notation
respresent the symbolic values for the variables a and b respectively, in the method process. Answer the subsequent questions.
Identify the path constraint that represents an equivalence class of input vectors containing all inputs that lead to the abort() call at LINE-2.
6406535902829.Source diagram or notation
6406535902830.Source diagram or notation
6406535902831.Source diagram or notation
6406535902832.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q45

Question 46 MCQ · 5.0 marks

Consider that concolic testing technique (DART) is used to test the following code segment. int mean(int a, int b){ return (a + b)/2; } int square(int n) { return n * n; } int process(int a, int b) { int t1 = mean(a, b); int t2 = square(t1) - (a * b) if(t2 <= 0) { // LINE-1 abort(); // LINE-2 } return t2; } Assume that
Source diagram or notation
and
Source diagram or notation
respresent the symbolic values for the variables a and b respectively, in the method process. Answer the subsequent questions.
Consider that DART generates a random input:
Source diagram or notation
. Which path constraint (PC) is generated for the next execution at LINE-1? Hint: DART negates the path constraint in the current execution to get the path constraint for the next execution.
6406535902833.Source diagram or notation
6406535902834.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q46