cs3002_2026T2_Q2_NA.pdf

Software Testing · Quiz 2 · May 2026

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

Question 2 MCQ · 2.0 marks

Consider the following statements regarding logic coverage criteria, and choose the correct option: i) A predicate with [[IMAGE:52de33da12de489a_2_2]] clauses has [[IMAGE:52de33da12de489a_2_3]] possible valuations. ii) GACC subsumes predicate coverage.

Both statements are incorrect.
Statement (ii) is correct and statement (i) is incorrect.
Statement (i) is correct and statement (ii) is incorrect.
Both statements are correct.

A published solution is not available for this question yet.

Question 3 MCQ · 2.0 marks

Consider the predicate [[IMAGE:52de33da12de489a_2_4]] . Which of the following options represents [[IMAGE:52de33da12de489a_2_5]] , i.e. the conditions under which clause [[IMAGE:52de33da12de489a_2_6]] determines [[IMAGE:52de33da12de489a_2_7]] ?

[[IMAGE:52de33da12de489a_2_8]]
[[IMAGE:52de33da12de489a_2_9]]
[[IMAGE:52de33da12de489a_2_10]]
[[IMAGE:52de33da12de489a_2_11]]

A published solution is not available for this question yet.

Question 4 MCQ · 2.0 marks

Consider that a mobile app is being developed for booking intercity bus tickets. One of the requirements specified for the app is that a notification should be sent to the passengers (users) on the date of booking with details of their itinerary. Which of the following types of requirements does the above belong to?

Business requirement
Functional requirement
Regulatory requirement
Non-functional requirement

A published solution is not available for this question yet.

Question 5 MCQ · 2.0 marks

Consider the following range of ambient temperature ( [[IMAGE:52de33da12de489a_3_12]] ) in [[IMAGE:52de33da12de489a_3_13]] (degree Celsius) for an electric motor. [[IMAGE:52de33da12de489a_3_14]] Which of the following test inputs would satisfy Boundary Value Analysis (BVA) for the given range?

[[IMAGE:52de33da12de489a_3_15]]
[[IMAGE:52de33da12de489a_3_16]]
[[IMAGE:52de33da12de489a_3_17]]
[[IMAGE:52de33da12de489a_3_18]]

A published solution is not available for this question yet.

Question 6 MCQ · 2.0 marks

Consider the following code segment for symbolic testing. [[IMAGE:52de33da12de489a_4_19]] Choose the appropriate path constraint (PC) for the [[IMAGE:52de33da12de489a_4_20]] loop with a sequence of [[IMAGE:52de33da12de489a_4_21]] [[IMAGE:52de33da12de489a_4_22]] outcomes followed by a [[IMAGE:52de33da12de489a_4_23]] . Consider each [[IMAGE:52de33da12de489a_4_24]] as a fresh symbolic value.

[[IMAGE:52de33da12de489a_4_25]]
[[IMAGE:52de33da12de489a_4_26]]
[[IMAGE:52de33da12de489a_4_27]]
[[IMAGE:52de33da12de489a_4_28]]

A published solution is not available for this question yet.

Question 7 MCQ · 3.0 marks

Consider four partitions with blocks [[IMAGE:52de33da12de489a_4_29]] , [[IMAGE:52de33da12de489a_4_30]] , [[IMAGE:52de33da12de489a_4_31]] , and [[IMAGE:52de33da12de489a_4_32]] . How many test requirements are there for All Combinations Coverage (ACoC)?

A published solution is not available for this question yet.

Question 8 MCQ · 3.0 marks

Consider a portal for a university library that determines book borrowing allowance for students based on two input variables (characteristics). Academic Level ( [[IMAGE:52de33da12de489a_5_33]] ): [[IMAGE:52de33da12de489a_5_34]] , [[IMAGE:52de33da12de489a_5_35]] , [[IMAGE:52de33da12de489a_5_36]] Enrollment Type ( [[IMAGE:52de33da12de489a_5_37]] ): [[IMAGE:52de33da12de489a_5_38]] , [[IMAGE:52de33da12de489a_5_39]] Note: Assume that it is possible for both inputs to be invalid also. The following are the rules for determining the allowance for one semester: ● Full-time undergraduate students receive an allowance of [[IMAGE:52de33da12de489a_5_40]] books. ● Full-time postgraduate students receive an allowance of [[IMAGE:52de33da12de489a_5_41]] books. ● Doctoral students receive an allowance of [[IMAGE:52de33da12de489a_5_42]] books. Part-time students receive half the allowance of full-time students. Doctoral students cannot be part-time. How many equivalence classes, including both valid and invalid inputs, can be identified in this scenario in total?

A published solution is not available for this question yet.

Question 9 MSQ · 3.0 marks

Which of the following statements are correct regarding symbolic execution?

Each symbolic execution is equivalent to a large number of normal test cases.
Symbolic execution is equivalent to proving that a program is fully correct.
Symbolic execution can also be terminated if the program hits an exit statement.
SMT solvers can always solve a given predicate constraint efficiently.

A published solution is not available for this question yet.

Question 10 MSQ · 2.0 marks

Consider the predicate [[IMAGE:52de33da12de489a_6_43]] . Which of the following options are true?

The predicate is in CNF.
The predicate has three clauses
The predicate is in DNF.
The predicate has four clauses

A published solution is not available for this question yet.

Question 11 MCQ · 2.0 marks

Consider the control flow graph (CFG), [[IMAGE:52de33da12de489a_6_44]] , where ● Set of vertices [[IMAGE:52de33da12de489a_6_45]] ● Set of edges [[IMAGE:52de33da12de489a_6_46]] ● Initial vertex [[IMAGE:52de33da12de489a_6_47]] ● Final vertex [[IMAGE:52de33da12de489a_6_48]] Based on the above data, answer the given subquestions.

How many decision nodes are there in [[IMAGE:52de33da12de489a_6_49]] ?

A published solution is not available for this question yet.

Question 12 MCQ · 3.0 marks

How many linearly independent paths are there in [[IMAGE:52de33da12de489a_7_50]] ?

A published solution is not available for this question yet.

Question 13 MCQ · 3.0 marks

What is the minimum number of test paths to achieve edge coverage on [[IMAGE:52de33da12de489a_7_51]] ?

A published solution is not available for this question yet.

Question 14 MCQ · 3.0 marks

Consider the predicate [[IMAGE:52de33da12de489a_7_52]] and its truth table given below. Note that the blank cells represent the value [[IMAGE:52de33da12de489a_7_53]] in the truth table. [[IMAGE:52de33da12de489a_8_54]] Based on the above data, answer the given subquestions.

Which of the following is the set of GACC pairs for clause [[IMAGE:52de33da12de489a_8_55]] ?

[[IMAGE:52de33da12de489a_8_56]]
[[IMAGE:52de33da12de489a_8_57]]
[[IMAGE:52de33da12de489a_8_58]]
[[IMAGE:52de33da12de489a_8_59]]

A published solution is not available for this question yet.

Question 15 MCQ · 3.0 marks

Which of the following is the set of RACC pairs for clause [[IMAGE:52de33da12de489a_8_60]] ?

[[IMAGE:52de33da12de489a_8_61]]
[[IMAGE:52de33da12de489a_8_62]]
[[IMAGE:52de33da12de489a_9_63]]
[[IMAGE:52de33da12de489a_9_64]]

A published solution is not available for this question yet.

Question 16 MCQ · 3.0 marks

Which of the following is the set of RICC pairs for clause [[IMAGE:52de33da12de489a_9_65]] ?

[[IMAGE:52de33da12de489a_9_66]] for [[IMAGE:52de33da12de489a_9_67]] , [[IMAGE:52de33da12de489a_9_68]] , for [[IMAGE:52de33da12de489a_9_69]]
[[IMAGE:52de33da12de489a_9_70]] for [[IMAGE:52de33da12de489a_9_71]] , [[IMAGE:52de33da12de489a_9_72]] , for [[IMAGE:52de33da12de489a_9_73]]
[[IMAGE:52de33da12de489a_9_74]] for [[IMAGE:52de33da12de489a_9_75]] , no feasible pair for [[IMAGE:52de33da12de489a_9_76]] .
[[IMAGE:52de33da12de489a_9_77]] for [[IMAGE:52de33da12de489a_9_78]] , no feasible pair for [[IMAGE:52de33da12de489a_9_79]] .

A published solution is not available for this question yet.

Question 17 MCQ · 3.0 marks

Consider that concolic testing technique (DART) is used to test the following code segment. [[IMAGE:52de33da12de489a_10_80]] Assume that [[IMAGE:52de33da12de489a_10_81]] and [[IMAGE:52de33da12de489a_10_82]] respresent the symbolic values for the variables [[IMAGE:52de33da12de489a_10_83]] , [[IMAGE:52de33da12de489a_10_84]] respectively in the method [[IMAGE:52de33da12de489a_10_85]] . Answer the given subquestions.

Which of the following options correctly represents the symbolic state ( [[IMAGE:52de33da12de489a_10_86]] ) at [[IMAGE:52de33da12de489a_10_87]] ?

[[IMAGE:52de33da12de489a_10_88]]
[[IMAGE:52de33da12de489a_10_89]]
[[IMAGE:52de33da12de489a_10_90]]
[[IMAGE:52de33da12de489a_10_91]]

A published solution is not available for this question yet.

Question 18 MCQ · 3.0 marks

Identify the path constraint that represents an equivalence class of input vectors containing all inputs that lead to the abort() call at [[IMAGE:52de33da12de489a_11_92]] .

[[IMAGE:52de33da12de489a_11_93]]
[[IMAGE:52de33da12de489a_11_94]]
[[IMAGE:52de33da12de489a_11_95]]
[[IMAGE:52de33da12de489a_11_96]]

A published solution is not available for this question yet.

Question 19 MCQ · 3.0 marks

Consider that DART generates a random input: [[IMAGE:52de33da12de489a_11_97]] . Which path constraint (PC) is generated for the next execution at [[IMAGE:52de33da12de489a_11_98]] ? Hint: DART negates the PC in the current execution to get the next one.