Skip to content
Official PYQ · 2011

GATE CS 2011 Q47 — Software Engineering (Historical)

Explain with AI

Historical syllabus topic · This subject is outside the current GATE syllabus.

The following is the comment written for a C function.

/* This function computes the roots of a quadratic equation
a.x^2 + b.x + c = 0. The function stores two real roots
in *root1 and *root2 and returns the status of validity
of roots. It handles four different kinds of cases.
    (i) When coefficient a is zero irrespective of discriminant
    (ii) When discriminant is positive
    (iii) When discriminant is zero
    (iv) When discriminant is negative
Only in case (ii) and (iii), the stored roots are valid.
Otherwise 0 is stored in the roots. The function returns
0 when the roots are valid and -1 otherwise.
The function also ensures root1 >= root2.
    int get_QuadRoots (float a, float b, float c,
        float *root1, float *root2);
*/

A software engineer is assigned the job of doing black box testing. He comes up with the following test cases, many of which are redundant.

Test
Case
Input Set Expected Output Set
a b c root1 root2 Return Value
T1 0.0 0.0 7.0 0.0 0.0 -1
T2 0.0 1.0 3.0 0.0 0.0 -1
T3 1.0 2.0 1.0 -1.0 -1.0 0
T4 4.0 -12.0 9.0 1.5 1.5 0
T5 1.0 -2.0 -3.0 3.0 -1.0 0
T6 1.0 1.0 4.0 0.0 0.0 -1

Which one of the following options provide the set of non-redundant tests using equivalence class partitioning approach from input perspective for black box testing?

Choose one option
View answer

Answer: C

Worked explanation not available yet.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Software Engineering (Historical) questions