Paper 2 CS · UNIT 06 · MOCK TEST

Mock 8 – Software Testing (Part 2)

Unit 6: Software Engineering · 28 questions · about 33 minutes. Press End Mock any time to see your score and the correct answers.

All 15 topic-wise mocks in this unit

0 / 28 answered 00:00

Q1. Which of the following are white-box testing techniques?
A. Path testing
B. Loop testing
C. Regression testing
D. Non-functional testing
Choose the correct answer from the options given below:

AA and B Only BB and C Only CC and D Only DA and D Only

Q2. Which of the following is NOT one of the principles of good coding?

ACreate unit tests before you begin coding. BCreate a visual layout that aids understanding. CRefactor the code after you complete the first coding pass. DWrite self-documenting code, not program documentation.

Q3. Which of the following is a technique used for component wrapping?

ABlack-box wrapping BClear-box wrapping CGray-box wrapping DWhite-box wrapping

Q4. The cyclomatic complexity metric provides the designer with information regarding the number of ______

ACycles in the program BErrors in the program CIndependent logic paths in the program DStatements in the program

Q5. Which of the following need not be assessed during unit testing?
A. Algorithmic performance
B. Number of lines of code
C. Error handling
D. Execution paths
Choose the correct answer from the options given below:

AA, B, C only BA, B, D only CA, C, D only DB, C, D only

Q6. Match List I with List II

List I	List II
A. Condition coverage	I. Black box testing
B. Equivalence class partitioning	II. System testing
C. Volume testing	III. White box testing
D. Alpha testing	IV. Performance testing

AA-II, B-III, C-IV, D-I BA-III, B-I, C-IV, D-II CA-IV, B-I, C-II, D-III DA-III, B-IV, C-I, D-II

Q7. For a function of n variables, boundary value analysis yields

A4n + 3 test cases B4n + 1 test cases Cn + 4 test cases D2n + 4 test cases

Q8. A fault-based testing technique is

AUnit testing BBeta testing CStress testing DMutation testing

Q9. Alpha and beta testing are forms of

AWhite-box testing BBlack-box testing CAcceptance testing DSystem testing

Q10. Which of the following is not a key strategy followed by the clean room approach to software development?

AFormal specification BDynamic verification CIncremental development DStatistical testing of the system

Q11.

Which of the followings is NOT a software characteristic?

ASoftware does not wear out BSoftware is flexible CSoftware is not manufactured DSoftware is always correct

Q12.

Match List I with List II

AA-II, B-III, C-I, D-IV BA-II, B-III, C-IV, D-I CA-III, B-II, C-I, D-IV DA-IV, B-II, C-I, D-III

Q13.

Collaborative document inspection technique used for?

ARequirement Validation Process BRequirement Verification Process CIntegration Testing DBlackbox Testing

Q14.

Match List - I with List - II.

A(A)-(I), (B)-(II), (C)-(III), (D)-(IV) B(A)-(I), (B)-(II), (C)-(IV), (D)-(III) C(A)-(I), (B)-(III), (C)-(II), (D)-(IV) D(A)-(I), (B)-(IV), (C)-(II), (D)-(III)

Q15.

The cyclomatic complexity of the following flow graph is :

A3 B4 C10 D2

Q16.

Match List-I with List-II :

Chowe the correct answer from the options given below :

AA-IV, B-III, C-I, D-II BA-I, B-II, C-III, D-IV CA-IV, B-III, C-II, D-I DA-III, B-IV, C-I, D-II

Q17.

Match List I with List II. List I: A. Scenario testing, B. Regression testing, C. Component testing, D. Beta testing. List II: I. To verify the I/O behaviour of a text object, II. User acceptance methodology, III. No new bugs after changes in the program, IV. The documentation of a use case.

AA-IV B-III C-II D-I BA-II B-I C-III D-IV CA-IV B-III C-I D-II DA-III B-I C-IV D-II P

Q18.

Which of the following is not one of the principles of good coding?

ACreate unit tests before you begin coding. BCreate visual layout that aids understanding. CRefractor the code after you completes the first coding pass. DWrite self-documenting code not program documentation.

Q19.

The cyclomatic complexity metric provides the designer with information regarding the number of -____

ACycles in the program BErrors in the program CIndependent logic paths in the program DStatements in the program a

Q20.

Match List I with List II

AA-II, B-III, C-IV, D-I BA-III, B-I, C-IV, D-II CA-IV, B-I, C-II, D-III DA-III, B-IV, C-I, D-II

Q21.

For a function of two variables, boundary value analysis yields,

A4 n+3 test cases B4 n+1 test cases Cn+4 test cases D2 n+4 test cases Q

Q22.

In software testing, beta testing is the testing performed by _______________.

Apotential customers at the developer's location Bpotential customers at their own locations Cproduct developers at the customer's location Dproduct developers at their own locations

Q23.

Given below are two statements

Statement I: Cleanroom software process model incorporates the statistical quality certification of code increments as they accumulate into a system.

Statement II: Cleanroom software engineering follows the classic analysis, design, code, test, and debug cycle to software development and focussing on defect removal rather than defect prevention. In light of the above statements, choose the correct answer from the options given below

ABoth Statement I and Statement II are true BBoth Statement I and Statement II are false CStatement I is true but Statement II is false DStatement I is false but Statement II is true

Q24.

Given below are two statements, one is labelled as Assertion A and the other is labelled as

Reason R

Assertion A : Software developers donot do exhaustive software testing in practice.

Reason R : Even for small inputs, exhaustive testing is too computationally intensive (e.g., takes too long) to run all the tests. In light of the above statements, choose the correct answer from the options given below

ABoth A and R are true and R is the correct explanation of A BBoth A and R are true but R is NOT the correct explanation of A CA is true but R is false DA is false but R is true

Q25.

Which of the following is/are behavioral testing technique(s)?

(A) Equivalence Partitioning

(B) Graph-Based Teating Method

(D) Data flow Testing

(E) Loop Testing

A(B) and (D) only B(A), (B) and (C) only C(D) and (E) only D(A), (C) and (E) only

Directions (Q91–95): A flow graph F with entry node 1 and exit node 11 is shown (figure with Q91). Its nodes are 1, (2,3), (4,5), 6, 7, 8, 9, 10 and 11, with edges 1→(2,3), (2,3)→6, (2,3)→(4,5), 6→7, 6→8, 7→9, 8→9, 9→10, (4,5)→10, 10→1 and 1→11.

Q26.

What is the cyclomatic complexity of flowgraph F?

A2 B3 C4 D5

Q27.

How many regions are there in flowgraph F ?

A2 B3 C4 D5

Q28.

Consider the following method:

int f(int m, int n, boolean x, boolean y)
{
    int res = 0;
    if (m < 0) { res = n − m; }
    else if (x || y) {
        res = −1;
        if (n == m) { res = 1; }
    }
    else { res = n; }
    return res;
} /* end of f */

If P is the minimum number of tests for full statement coverage of f() and Q is the minimum number for full branch coverage, then (P, Q) =

A(3,4) B(4,3) C(2,3) D(3,2)

Next: Mock 9 – Metrics, Estimation & Project Management (Part 1) →