Home / Study library / Software Testing / Quiz 1 · Jan 2024 Software Testing · Quiz 1 · Jan 2024
Software Testing · Quiz 1 · Jan 2024
← Course papers · Start practice / exam
This page contains the reliably extracted subset, not the complete original paper.
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 18 published solutions
Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q16 Q17 Q18 Q19
Question 2 MCQ · 5.0 marks Which of the following approaches to integration testing does not require scaffolding?
A published solution is not available for this question yet.
Report a correction for Q2
Question 3 MCQ · 5.0 marks 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.
A published solution is not available for this question yet.
Report a correction for Q3
Question 4 MCQ · 5.0 marks Match the following based on different levels of testing.
6406532474011. A-4, B-1, C-3, D-2
6406532474012. A-4, B-3, C-2, D-1
6406532474013. A-2, B-1, C-3, D-4
6406532474014. A-2, B-3, C-4, D-1
A published solution is not available for this question yet.
Report a correction for Q4
Question 5 MCQ · 6.0 marks Consider the control flow graph (CFG) below.
From the following code segments identify the one that is best presented by the given CFG.
6406532473971. 6406532473972. 6406532473973. 6406532473974. A published solution is not available for this question yet.
Report a correction for Q5
Question 6 MCQ · 6.0 marks Consider the code below.
Identify the appropriate condition such that the execution will reach the error statement in LINE-1.
6406532474019. (x < y) && (x > 5) && (y < 0)
6406532474020. (x < y) && (x < 5) && (y <= 0)
6406532474021. (x < y) && (x < 4) && (y < 1)
6406532474022. (x < y) && (x < 4) && (y <= 1)
A published solution is not available for this question yet.
Report a correction for Q6
Question 7 MCQ · 6.0 marks 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.
6406532474032. [1, 2, 3, 2, 4]
6406532474033. [1, 2, 3, 4]
6406532474034. [1, 2, 4, 2, 4]
A published solution is not available for this question yet.
Report a correction for Q7
Question 8 MCQ · 6.0 marks 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.
6406532474035. testcase1()
6406532474036. testcase2()
6406532474037. testcase3()
6406532474038. testcase4()
A published solution is not available for this question yet.
Report a correction for Q8
Question 9 MCQ · 6.0 marks Consider the finite state machine (FSM) as given below.
Identify the statement that correctly describes the given FSM.
6406532474039. It accepts all strings that have odd number of 0s and odd number of 1s.
6406532474040. It accepts all strings that have even number of 0s and even number of 1s.
6406532474041. It accepts all strings that have odd number of 0s and even number of 1s.
6406532474042. It accepts all strings that have even number of 0s and odd number of 1s.
A published solution is not available for this question yet.
Report a correction for Q9
Question 10 MSQ · 5.0 marks Which of the following is/are represented by the nodes in graph models for integration testing?
6406532474002. Test Drivers
A published solution is not available for this question yet.
Report a correction for Q10
Question 11 MSQ · 5.0 marks Consider the CFG given below.
From the following options, identify all the valid test paths.
6406532474015. [1, 2, 3, 5, 6, 1]
6406532474016. [1, 2, 3, 5, 2, 4, 5, 6]
6406532474017. [1, 2, 3, 5, 2, 3, 5, 6, 1, 2, 3, 5, 6]
6406532474018. [1, 2, 3, 4, 5, 6, 1, 2, 5, 6]
A published solution is not available for this question yet.
Report a correction for Q11
Question 12 MSQ · 5.0 marks 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?
6406532474023. Initial and terminal vertices are distinct.
6406532474024. Any one interior vertices should have out-degree as 2.
6406532474025. All the interior vertices have both in-degree and out-degree as 1.
6406532474026. All the interior vertices have both in-degree and out-degree as ≥1.
A published solution is not available for this question yet.
Report a correction for Q12
Question 13 MSQ · 5.0 marks Which of the following statements is/are true?
6406532474027. Prime path coverage subsumes all du-paths coverage.
6406532474028. Edge-pair coverage subsumes prime path coverage.
6406532474029. Node coverage subsumes edge coverage.
6406532474030. Edge-pair coverage subsumes edge coverage.
A published solution is not available for this question yet.
Report a correction for Q13
Question 14 MCQ · 6.0 marks
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?
6406532473983. It is 1 for both node coverage and edge coverage.
6406532473984. It is 1 for node coverage, and 3 for edge coverage.
6406532473985. It is 3 for both node coverage and edge coverage.
6406532473986. It is 2 for node coverage, and 3 for edge coverage.
A published solution is not available for this question yet.
Report a correction for Q14
Question 15 MCQ · 5.0 marks
Based on the above data, answer the given subquestions.
What is the cyclomatic complexity of the given CFG?
A published solution is not available for this question yet.
Report a correction for Q15
Question 16 MCQ · 6.0 marks Consider the CFG given below.
Based on the above data, answer the given subquestions.
Find the number of test requirements for prime path coverage.
A published solution is not available for this question yet.
Report a correction for Q16
Question 17 MCQ · 6.0 marks 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.
6406532473979. {[1, 6], [1, 2, 5, 6], [1, 2, 3, 4, 3, 4, 3, 5, 6]}
6406532473980. {[1, 6], [1, 2, 3, 4, 3, 5, 6]}
6406532473981. {[1, 6], [1, 2, 5, 6], [1, 2, 3, 5, 6], [1, 2, 3, 4, 3, 5, 6]}
6406532473982. {[1, 6], [1, 2, 5, 6], [1, 2, 3, 5, 6], [1, 2, 3, 4, 3, 4, 3, 5, 6]}
A published solution is not available for this question yet.
Report a correction for Q17
Question 18 MCQ · 6.0 marks 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?
A published solution is not available for this question yet.
Report a correction for Q18
Question 19 MCQ · 6.0 marks 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?
6406532473998. 7
**AI**
**Section Id :** 64065351451
**Section Number :** 2
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 8
**Number of Questions to be attempted :** 8
**Section Marks :** 25
**Display Number Panel :** Yes
**Section Negative Marks :** 0
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
Yes
**Clear Response :**
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.
Report a correction for Q19