Scribd
Upload
22 views2 pages

Model QP (2024-2025) Batch

This document outlines the examination structure for the Second Semester MCA Software Testing course at Dayananda Sagar Academy of Technology & Management. It includes details on the course code, maximum marks, duration, and instructions for answering questions from various modules. The exam consists of multiple questions covering topics such as error definitions, test planning, test coverage metrics, boundary value analysis, and fault-based testing.

Uploaded by

Sunita Jeevangi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views2 pages

Model QP (2024-2025) Batch

This document outlines the examination structure for the Second Semester MCA Software Testing course at Dayananda Sagar Academy of Technology & Management. It includes details on the course code, maximum marks, duration, and instructions for answering questions from various modules. The exam consists of multiple questions covering topics such as error definitions, test planning, test coverage metrics, boundary value analysis, and fault-based testing.

Uploaded by

Sunita Jeevangi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

USN

DAYANANDA SAGAR ACADEMY OF TECHNOLOGY & MANAGEMENT


(An Autonomous Institute under VTU, Belagavi)

Second Semester MCA Semester End Examination Oct/Nov 2024


Course: SOFTWARE TESTING
Course Code: MMC324
Max Marks: 100 Duration: 03 Hours

Note:
1. Answer any FIVE full questions, choosing at least ONE question from each MODULE
2. Any missing Data can be suitably assumed.

Module - 1 Marks BL CO
Define the terms error, fault, failure, and bug in the context of
a software testing. Provide an example for each term to illustrate their 10 CO1 L2
differences.
Construct a test plan for a sorting program that sorts integers in
Q.1 b ascending or descending order based on user input. Include test 10 CO2 L3
cases for valid and invalid inputs.
OR
Illustrate the process of testing and debugging with a diagram.
a Explain each step involved in the cycle. 10 CO2 L2

Demonstrate the differences between valid and invalid inputs in


b 10 CO2 L3
Q.2 software testing using an example of a program that calculates the
square root of a number.
Module – 2
a Examine the role of test coverage metrics in structural testing, and 10 CO3 L4
explain how they enhance testing management.
Evaluate the suitability of equivalence class partitioning for the
b NextDate function, considering its input domain complexities 10 CO4 L5
Q.3
OR
Analyse the impact of input domain constraints on testing strategies,
a using the Saturn Windshield Wiper Controller as a case study. 10 CO3 L4
Q.4 Critique the limitations of decision table-based testing when applied
b to the Commission Problem, contrasting it with its effectiveness in 10 CO4 L5
the Triangle Problem.
Module – 3
10 CO2 L3
a Apply boundary value analysis to generate test cases for a function
that accepts two integers (x: [1, 100], y: [50, 200]). How many test
Q5 cases are produced?
Evaluate the effectiveness of decision table-based testing for the 10 CO4 L5
b
Commission Problem. Why it is less suitable compared to the
Triangle Problem?
OR
Summarize weak equivalence class testing and design test cases for
a 10 CO3 L3
the Triangle Problem (equilateral, isosceles, scalene, and invalid)
Q.6 and justify your selections.
Critically assess the role of special value testing in scenarios where
b formal techniques (e.g., BVA, equivalence partitioning) fall short. 10 CO4 L5
Provide an example.
Module – 4
Synthesize the concept of slice-based testing by constructing slices
a for the variable commission in the commission problem. Create a 10 CO3 L4
lattice diagram to show the subset relationships between slices and
explain their significance in debugging.
Q.7 Analyze the feasible and infeasible paths in the basis path testing of
b the triangle problem. Compare the original basis paths with the 10 CO2 L3
reduced set after eliminating infeasible paths. Discuss the impact of
logical dependencies on path selection
OR
Apply McCabe’s basis path testing method to the bubble sort
a algorithm (provided in the module). Demonstrate the steps to 10 CO3 L4
compute cyclomatic complexity, derive the basis set of paths, and
design test cases to cover them.
Q.8 Explain data flow testing with a focus on Define/Use testing.
b Illustrate the process by identifying du-paths and dc-paths for the 10 CO2 L3
variable sales in the commission problem. Discuss how these paths
help detect anomalies.
Module – 5
a Analyze the differences between strong mutation and weak mutation 10 CO3 L4
testing. Discuss scenarios where weak mutation might fail to detect
Q.9 faults that strong mutation would catch, using the Transduce
program mutants as examples
Define fault-based testing and list the key assumptions (competent
b 10 CO2 L3
programmer hypothesis, coupling effect) that underpin its
effectiveness. Provide examples of common mutation operators like
AOR or ROR.
OR
Design a generic scaffolding framework for unit testing a Java.
a Include components like test drivers, stubs, and oracles, and justify 10 CO3 L4
Q.10 how your design ensures controllability and observability.
Apply the fault-based adequacy criteria to evaluate a test suite for a
b given program (e.g., the Transduce program). Calculate the 10 CO2 L3
adequacy score if 3 out of 5 non-equivalent mutants are killed, and
justify the result.

You might also like