What are common examiner traps in Software Testing?

Selecting multiple test cases that belong to the exact same equivalence class (redundant testing). Failing to identify corner/boundary cases (e.g., coefficient a = 0 dominating discriminant calculation). Missing one equivalence partition completely while assembling the final test suite.

GATE CSE Software Testing PYQs

Standard yield12.5% of Software Engineering

Software Testing appears very rarely in GATE Computer Science, historically tested under Software Engineering / Programming methodologies. The primary focus is… Read the guide

Take topic test

Questions: 1
Asked: 2011
Total marks: 2
Marks / paper: 0.3

1 GATE CSE Software Testing PYQs with solutions, from Software Engineering. Browse all GATE CSE PYQs.

Questions

Every official paper that asked this topic, newest first.

GATE CSE 2011 · Q47The 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); */…MCQ2 marksMediumDiagramSolve

What GATE tests in Software Testing

Concepts, patterns, formulas and traps distilled from past papers.

Software Testing appears very rarely in GATE Computer Science, historically tested under Software Engineering / Programming methodologies. The primary focus is on Black-Box Testing techniques, specifically Equivalence Class Partitioning (ECP). Questions present a functional specification with explicit conditions and require identifying a minimal, non-redundant set of test cases covering all equivalence classes.

Core concepts

Black-Box Testing
Equivalence Class Partitioning (ECP)
Input Domain Partitioning (Valid vs. Invalid classes)
Test Suite Minimization and Non-redundancy

Recurring question patterns

Equivalence Class Partitioning for Black-Box Testing
RareMCQ2 marks2011
A function specification defines disjoint input domains or functional behavior classes. A candidate test suite of specific input values is given, and the task is to select a minimal non-redundant subset that contains exactly one test case per equivalence partition.

Formulas GATE uses

Discriminant Condition for Quadratic Equation

D = b^2 - 4ac

Used to partition input domain into real distinct ( $D > 0$ ), real equal ( $D = 0$ ), and complex roots ( $D < 0$ ) alongside boundary condition $a = 0$ .

Examiner traps in Software Testing

Selecting multiple test cases that belong to the exact same equivalence class (redundant testing).
Failing to identify corner/boundary cases (e.g., coefficient a = 0 dominating discriminant calculation).
Missing one equivalence partition completely while assembling the final test suite.

How questions are asked

Select non-redundant test case subset matching equivalence partitions
Map concrete test case inputs to behavioral equivalence classes

Paper trends

Software Testing was briefly tested as part of the broader Software Engineering / C programming syllabus in GATE 2011 as a 2-mark conceptual application question.
2011

Difficulty notes

Easy: Direct theoretical definitions of black-box vs white-box testing. Medium: Evaluating given input tuples against mathematical or logical conditions (e.g., quadratic roots, triangle classification) to find the unique non-redundant combination. Hard: Identifying hidden boundary conditions and determining minimal path/branch coverage vs equivalence coverage simultaneously.