STM – TWO MARKS WITH ANSWERS

Unit -I
1. Define Component or Unit testing.
Component testing - validates the behaviour of each individual component or module
of a software application separately, without integrating with other components
2. Define Integration Testing?
Combining or Integrating all the modules or units or components of the program to
test as the whole as a single unit is called Integration testing
3. Compare small versus large? (Dichotomies)
Programming in large means constructing programs that consists of many components
written by many different programmers.
Programming in the small is what we do for ourselves in the privacy of our own
offices.
4. Define Environment?
The test environment is the hardware and software set up for the testing test cases.
5. Differentiate function versus structure testing?
In Functional testing, the program or system is treated as a black box. It is subjected
to inputs, and its outputs are verified for conformance to specified behavior.
Structural testing does look at the implementation details. Things such as
programming style, control method, source language, database design, and coding
details dominate structural testing.
6. State Builder vs Buyer?
Builder: Who designs the system and is accountable to the buyer.
Buyer: Who pays for the system in the hope of profits from providing services?
User: Ultimate beneficiary of the system. T
Tester: Who is dedicated to the builder's destruction.
Operator: Who has to live with the builders' mistakes.

7. What are the consequences of Bugs.

The importance of bugs depends on frequency, correction cost, installation cost, and
consequences.
 Frequency: How often does that kind of bug occur? Pay more attention to the
more frequent bug types.
 Correction Cost: What does it cost to correct the bug after it is found? The cost is
the sum of 2 factors: (1) the cost of discovery (2) the cost of correction. These
costs go up dramatically later in the development cycle when the bug is
discovered. Correction cost also depends on system size.
 Installation Cost: Installation cost depends on the number of installations: small
for a single user program but more for distributed systems. Fixing one bug and
distributing the fix could exceed the entire system's development cost.
 Consequences: What are the consequences of the bug? Bug consequences can
range from mild to catastrophic.

8. Define path selection or path testing?

 Path testing is a structural testing - using the source code to find every possible
executable path. It helps to determine all faults lying within a piece of code. This
method is designed to execute all or selected path through a computer program.

9. Define structural bugs?

Include paths left out, unreachable code, improper nesting of loops, loop-back or loop
termination criteria incorrect, missing process steps, duplicated processing,
unnecessary processing.
10. What is Test Bed?
The test execution environment configured for testing. Test bed consists of specific
hardware, software, Operating system, network configuration, the product under test,
other system software and application software.

UNIT – II
1. Compare static versus dynamic anomaly detection
Static - Done on source code without actually execution it
Example: Source code syntax error detection is the static analysis result
Dynamic - the program is being executed and is based on intermediate values that result
from the programs execution
Example: A division by zero warning is the dynamic result
2. Define the complications in Transaction Flows
Transaction flows don’t have a good structured design for code. The problems of transaction
flows result in problems like error conditions, malfunctions, recovery actions etc. These
errors are unstructured. As features are added into the transaction flows the complexity of the
transaction flow increases.

3. Define Interface Testing.

Interface Testing - verifies the interaction between two separate systems of an application

4. Define nice domains?

A domain with the following properties are called nice domains. They are Linear, Complete,
Systematic, And Orthogonal, Consistently closed, Convex and simply connected.
5. Define domain Closure.
A domain boundary is closed with respect to a domain if the points on the boundary belong
to the domain. If the boundary points belong to some other domain, the boundary is said to be
open.
 UNIT – III
1. Define path.

A path is a sequence of control flow nodes usually beginning from the entry node of a

Graph through to the exit node.

2. Define Path Products?

The concatenation of names of two consecutive path segments is called a path product.

3. Define Path expression?

Path expression is defined as an expression which represents set of all possible paths between an
entry and exit nodes

4. What is ambiguous bug?

It means unclear or able to be understood in many ways.

5. Define path sum?

The path sum is the sum of all the parallel links between two nodes or sum of all parallel paths
between two nodes. Path sum is denoted by ‘+’.
6. Define path sensitization
The act of finding a set of solutions to the path predicate expression is called path
sensitization.
7. What is Predicate?
PREDICATE: The logical function evaluated at a decision is called Predicate
PATH PREDICATE:
A predicate associated with a path is called a Path Predicate. For example, "x is
greater than zero"

UNIT - IV
1. What is state transition testing?
State Transition Testing is a type of software testing which is performed to check the
change in the state of the application under varying input. The condition of input passed is
changed and the change in state is observed.
2. Define State.

A state is an internal configuration of a system or component. It is defined in terms of the

values assumed at a particular time for the variables that characterize the system or
component.

3. Define Finite-State machine.

A finite-state machine is an abstract machine that can be represented by a state graph having
a finite number of states and a finite number of transitions between states.

4. Define Error Guessing.

The tester/developer is sometimes able to make an educated “guess’ as to which type of

defects may be present and design test cases to reveal them. Error Guessing is an ad-hoc
approach to test design in most cases.

UNIT V
1. Define graph Matrix.
A graph matrix is a square array with one row and one column for every node in the graph.
Each row-column combination corresponds to a relation between the node corresponding to
the row and the node corresponding to the column.
2. What is a power of a Matrix?
Power of a matrix is the product of multiplying a square matrix by itself a specific number of
times
3. Define good and bad state graphs?
A state graph is said to be good , when every state , input , transition and output is specified
clearly and understandable. A state graph is said to be bad , when every state , input ,
transition and output is not specified clearly and difficult to understand.
4. Define unreachable state?
A state that no input sequence can reach
5. Define Dead State?
A dead state is a state that once entered cannot be left. This is not necessarily a bug but it is
suspicious
6. Define Cyclomatic Complexity.
The cyclomatic complexity obtained by subtracting 1 from the total number of entries in each
row and ignoring rows with no entries.
7. Name some Software Testing tools.
JMeter, Win Runner, Load Runner and Selenium etc.,
JMeter is an open source testing software. Used for load and performance testing. JMeter is
designed to analyse and measure the performance and load functional behaviour of web
application.
Win Runner – is an Automated Testing Tool.
Load Runner – is an Performance Testing Tool.
Selenium - Open source Web UI (User Interface) automation testing suite.
8. Define Loop or Self Loop in Graphs.
In graph, a loop (also called a self-loop or a buckle) is an edge that connects a vertex to
itself. A simple graph contains no loops.
9. What are the steps in Node reduction algorithm?
Combine all serial links by multiplying their path expressions. (Cross term reduction)
Combine all parallel links by adding their path expressions. (Parallel Reduction)
Remove all self-loops. (Loop Reduction)
10. What is a Relation?
The property by which two nodes are interconnected is called a relation.