Software Testing Assignment Questions
Software Testing Assignment Questions
Regression test cases are characterized by test cases that execute the affected or modified statements, as these ensure any new defects introduced due to changes are detected .
Conditional testing for scholarship eligibility requires 7 test cases, accounting for the disqualifying conditions (e.g., receipt of other scholarships and backlogs) and different combinations of CGPA and parental income criteria, ensuring all logic branches and conditions are checked .
The structure chart is typically used to design the integration test plan because it provides a hierarchical representation of the software's structure, highlighting module interdependencies and facilitating a pathway for integration testing .
To achieve pairwise coverage for a user interface with three checkboxes, at least four test cases are required: (000), (010), (101), and (111). These test cases cover all combinations of two checkboxes being checked or unchecked, ensuring interaction coverage .
Strong equivalence class testing requires at least 20 test cases because it involves creating test cases for all combinations of equivalence classes, ensuring comprehensive coverage of interactions among input variables .
For weak equivalence class testing of the compute-electricity-bill function, 8 test cases are required. This is determined by identifying classes based on each condition such as customer type and unit slabs, ensuring each class has at least one test case .
The formula (4n + 1) is used to determine the number of test cases for boundary value testing of a function with n independent variables. This formula accounts for upper and lower bounds testing, including an additional test case for nominal behavior .
Boundary value testing requires 21 test cases for a function with 5 integer input parameters because it covers the boundaries of each parameter, computed using the formula (4n + 1) for n independent variables .
The estimation of latent errors can be achieved using the formula n * [(S − s) / s], where n is the number of new errors found, S is the number of seeded errors, and s is the detected seeded errors. Using this, we calculate: 16 * [(100 - 80) / 80] = 4 latent errors .
The valid input values for the function find-intersection can be divided into three equivalence classes: parallel lines (m1=m2, c1≠c2), intersecting lines (m1≠m2), and coincident lines (m1=m2, c1=c2). These classes distinguish different geometric scenarios of line intersections .