Scribd
Upload
65 views2 pages

STM February 2023

The document discusses software testing methodologies and contains 10 questions in Part A and Part B. Part A contains short answer questions on topics like path testing, data flow testing, and path expressions. Part B contains longer answer and numerical questions about topics such as testing vs debugging, types of bugs, transaction flow testing, finite state machines, and graph theory concepts.

Uploaded by

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

STM February 2023

The document discusses software testing methodologies and contains 10 questions in Part A and Part B. Part A contains short answer questions on topics like path testing, data flow testing, and path expressions. Part B contains longer answer and numerical questions about topics such as testing vs debugging, types of bugs, transaction flow testing, finite state machines, and graph theory concepts.

Uploaded by

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

Code No: 156CW R18

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD


B. Tech III Year II Semester Examinations, February - 2023
SOFTWARE TESTING METHODOLOGIES
JN
(Common to CSE, IT)
Time: 3 Hours Max. Marks: 75

Note: i) Question paper consists of Part A, Part B.


TU
ii) Part A is compulsory, which carries 25 marks. In Part A, Answer all questions.
iii) In Part B, Answer any one question from each unit. Each question carries 10 marks
and may have a, b as sub questions.
H
PART – A
(25 Marks)
U
1.a) Define path testing. [2]
b) What is the difference between an error and a bug? [3]
se
c) Write a short note on random testing. [2]
d) What is the significance of data flow testing? [3]
e) Write a short note on path expressions. [2]
d
f) List out the different operators that are used to solve any boolean algebra. [3]
g) Define a transition bug. [2]
h) What is good state graph? [3]
pa
i) Define a connection matrix. [2]
j) List the applications of graph matrices. [3]

PART – B
pe
(50 Marks)

2.a) Differentiate between testing and debugging.


rs
b) Describe the model for testing. [5+5]
OR
3. Classify the different types of bugs and explain. [10]
20
4.a) State and explain the transaction flow testing techniques.
b) Compare static slicing with dynamic slicing. [6+4]
OR
23
5. How developers and testers treat nice and ugly domains? Illustrate with the help of
examples. [10]

6.a) Illustrate maximum path count arithmetic with an example.


b) Describe the usage of regular expression in flow anomaly detection. [6+4]
OR
7.a) Justify the use of decision table implementation for designing test cases.
b) Explain the procedure for specification validation using KV charts. [5+5]
8. Explain the following terms:
a) Design guideline for building finite state machine
b) Inessential finite state behavior. [5+5]
JN
OR
9.a) Write short notes on testability tips.
b) Summarize the concept transition testing. [5+5]
TU
10.a) Describe node-term reduction optimization.
b) Give a brief summary on relations. [5+5]
OR
11. Write an algorithm for node reduction using matrix operations and explain. [10]
H
U
---ooOoo---
se
d
pa
pe
rs
20
23

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy