Jawaharlal Nehru Technological University Hyderabad

Jawaharlal Nehru Technological University Hyderabad MCA V Semester SOFTWARE TESTING METHODOLOGIES Previous Question Paper (February - 2021 - R17)

MCA | V Semester | V | R17 | February - 2021

Answer PaperPaper Code: 845ABMaximum Marks: 75Time: 2 hours

Answer any five questions. All questions carry equal marks.

Main

115 marks
a

Describe the nightmare list and when to stop testing.

7 marks

Answer

The nightmare list is a prioritized collection of high-risk, complex, or critical scenarios that are most likely to cause system failure or catastrophic errors. It serves as a focus area for testers to ensure that the most problematic components of the software are subjected to rigorous scrutiny before release. Testing should stop when the following criteria are met: the nightmare list items are fully validated, all high-priority defects are resolved and verified, the software meets the pre-defined exit criteria (such as a specific pass rate or coverage percentage), and the remaining open defects are classified as low-risk or cosmetic issues that do not impact core functionality or user experience.

b

Explain implement and application of path testing.

8 marks

Answer

Path testing is a structural testing technique that aims to execute every independent path through a program's control flow graph (CFG). The implementation involves the following steps:

  1. Construct the Control Flow Graph (CFG) of the code, representing nodes as statements and edges as the flow of control.
  2. Calculate the Cyclomatic Complexity using the formula V(G) = E - N + 2P, where E is the number of edges, N is the number of nodes, and P is the number of connected components.
  3. Identify a set of linearly independent paths based on the cyclomatic complexity value.
  4. Design test cases to traverse each of these independent paths to ensure complete path coverage.

Path testing is applied during the unit testing phase to ensure that all logical branches and decision points are exercised. It is particularly effective for identifying hidden logic errors, redundant code, and complex conditional dependencies that might be missed by simpler testing methods. By ensuring every independent path is executed, developers can achieve a high degree of confidence in the internal logic of the software module.

215 marks
a

Explain about structural bugs.

7 marks

Answer

Sign in to view the complete answer paper.

b

Explain in detail about path sensitizing with examples.

8 marks

Answer

Sign in to view the complete answer paper.

315 marks
a

Describe closure compatibility and span compatibility.

7 marks

Answer

Sign in to view the complete answer paper.

b

Write the strategies of data-flow testing.

8 marks

Answer

Sign in to view the complete answer paper.

4

Where do domains comes from? Explain nice domains.

15 marks

Answer

Sign in to view the complete answer paper.

515 marks
a

Discuss about the probability of getting there with example.

7 marks

Answer

Sign in to view the complete answer paper.

b

What are the rules of Boolean algebra? Explain.

8 marks

Answer

Sign in to view the complete answer paper.

6

Describe state bugs and encoding bugs in detail.

15 marks

Answer

Sign in to view the complete answer paper.

7

Explain about state testing in detail.

15 marks

Answer

Sign in to view the complete answer paper.

815 marks
a

Explain the following: Equivalence and partial ordering relations.

7 marks

Answer

Sign in to view the complete answer paper.

b

Building tools of graph matrices.

8 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the question paper of SOFTWARE TESTING METHODOLOGIES from Jawaharlal Nehru Technological University Hyderabad for MCA V Semester V, February - 2021, R17.

For the solved question paper with answers, switch to the Answer Paper tab.

Other papers in SOFTWARE TESTING METHODOLOGIES

Loading Question Papers

Fetching data from database...