cs3002_2025T3_Q2_NA.pdf

Using the COCOMO model and the given cost drivers, what is the final estimated effort (in person- months) for the project?

If QWave Solutions wants to complete the project in 4 months, how many full-time developers are required?

Which of the following structural graph coverage criteria subsumes All DU-Paths Coverage on a data flow graph?

Consider four partitions with blocks [[IMAGE:4ca6f33985da5487_2_0]] , [[IMAGE:4ca6f33985da5487_2_1]] , [[IMAGE:4ca6f33985da5487_2_2]] , and [[IMAGE:4ca6f33985da5487_2_3]] .What is the minimum number of tests required to satisfy Each Choice Coverage (ECC) criterion?

Consider the predicate [[IMAGE:4ca6f33985da5487_3_4]] . Which of the following options represents [[IMAGE:4ca6f33985da5487_3_5]] , i.e. the conditions under which clause [[IMAGE:4ca6f33985da5487_3_6]] determines [[IMAGE:4ca6f33985da5487_3_7]] ?

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?

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?

Active Clause Coverage (ACC) is equivalent to which of the following classical coverage criteria for source code?

Consider the following range for a product's warranty period. [[IMAGE:4ca6f33985da5487_5_12]] . Which of the following test inputs would satisfy Boundary Value Analysis (BVA) for the given partition?

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 [[IMAGE:4ca6f33985da5487_5_17]] true outcomes followed by a false. Consider each [[IMAGE:4ca6f33985da5487_5_18]] as a fresh symbolic value.

Consider the predicate [[IMAGE:4ca6f33985da5487_6_23]] . Which of the following options are true?

Consider the predicate [[IMAGE:4ca6f33985da5487_6_24]] and its truth table given below. Note that the blank cells represent the value [[IMAGE:4ca6f33985da5487_6_25]] in the truth table. [[IMAGE:4ca6f33985da5487_7_26]] 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 [[IMAGE:4ca6f33985da5487_7_27]] ?

Consider the predicate [[IMAGE:4ca6f33985da5487_6_24]] and its truth table given below. Note that the blank cells represent the value [[IMAGE:4ca6f33985da5487_6_25]] in the truth table. [[IMAGE:4ca6f33985da5487_7_26]] 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 [[IMAGE:4ca6f33985da5487_7_28]] ?

Consider the control flow graph (CFG), [[IMAGE:4ca6f33985da5487_8_37]] , where • Set of vertices [[IMAGE:4ca6f33985da5487_8_38]] • Set of edges [[IMAGE:4ca6f33985da5487_8_39]] • Initial vertex [[IMAGE:4ca6f33985da5487_8_40]] • Final vertex [[IMAGE:4ca6f33985da5487_8_41]] Based on the above data, answer the given subquestions.

What is the cyclomatic complexity of [[IMAGE:4ca6f33985da5487_8_42]] ?

Consider the control flow graph (CFG), [[IMAGE:4ca6f33985da5487_8_37]] , where • Set of vertices [[IMAGE:4ca6f33985da5487_8_38]] • Set of edges [[IMAGE:4ca6f33985da5487_8_39]] • Initial vertex [[IMAGE:4ca6f33985da5487_8_40]] • Final vertex [[IMAGE:4ca6f33985da5487_8_41]] Based on the above data, answer the given subquestions.

How many test requirements are there for edge-pair coverage on [[IMAGE:4ca6f33985da5487_8_43]] ?

Consider the control flow graph (CFG), [[IMAGE:4ca6f33985da5487_8_37]] , where • Set of vertices [[IMAGE:4ca6f33985da5487_8_38]] • Set of edges [[IMAGE:4ca6f33985da5487_8_39]] • Initial vertex [[IMAGE:4ca6f33985da5487_8_40]] • Final vertex [[IMAGE:4ca6f33985da5487_8_41]] Based on the above data, answer the given subquestions.

What is the minimum number of test paths needed to achieve edge coverage on [[IMAGE:4ca6f33985da5487_9_44]] .

Consider the following data flow graph and answer the subsequent questions. [[IMAGE:4ca6f33985da5487_9_45]]

How many test requirements are there to satisfy All-Defs Coverage for variable x?

Consider the following data flow graph and answer the subsequent questions. [[IMAGE:4ca6f33985da5487_9_45]]

How many test requirements are there to satisfy All-Uses Coverage for variable x?

Consider the following data flow graph and answer the subsequent questions. [[IMAGE:4ca6f33985da5487_9_45]]

Which of the following is not a def-clear path for variable x?

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 [[IMAGE:4ca6f33985da5487_11_50]] and [[IMAGE:4ca6f33985da5487_11_51]] 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.

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 [[IMAGE:4ca6f33985da5487_11_50]] and [[IMAGE:4ca6f33985da5487_11_51]] 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: [[IMAGE:4ca6f33985da5487_11_56]] . 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.