EEX3467 DS#5 PPT
EEX3467 DS#5 PPT
• Software Quality
• Software quality characteristics
• Software Testing
• Testing Strategies
• Software Maintenance
• Project Management
SOFTWARE QUALITY
• What is Quality
To the producer, a product is a quality product if it
meets or conforms to the statement of
requirements that defines the product. However, to
the customer, a product is a quality product if it meets
the customer’s needs, regardless of whether the
requirements were met.
The X system reading integer values from the number 1 to number 10.
As a Quality Assurance Engineer you have to do the above Black box
testing techniques.
• Path testing
• Loop testing
• Condition testing
PATH TESTING
LOOP TESTING
{
…….
while(50,000)
……
……
}
Test P
{
……
…… }
CONDITION COVERAGE
Can be done with 2 test cases
(A
1 ) = 2, B = 0, X = 4 ), (A = 1, B = 1, X =
Multiple condition testing
Can be done with 4 test cases
(A
1 ),= 2, B = 0, X = 4 ), (A = 2, B = 1, X =
(A
1 ) = 1, B = 0, X = 2 ), (A = 1, B = 1, X =
In the example the test cases for decision
testing
cover paths : <ace> and <abd>
Another valid set of test cases
={(A
1 ),=}1, B = 0, X = 3 ), (A = 2, B = 1, X
both cover the same path <abe>
This
test emphasizes the need for combining
strategies.
COMPUTING TEST
COVERAGE
• Cyclomatic complexity (or conditional complexity)
• directly measures the number of linearly
independent paths through a program's source
code
• computed using the control flow graph of the
program: the nodes of the graph correspond to
indivisible groups of commands of a program,
and a directed edge connects two nodes if the
second command might be executed
immediately after the first command
• Cyclomatic complexity may also be applied to
individual functions, modules, methods or classes
within a program
BASIS PATH TESTING
Is to test each linearly independent path through the
program; the number of test cases will equal the
Mathematically, the cyclomatic complexity of a
structured program
• Cyclomatic complexity M, M = E − N + 2P
where
• E = the number of edges of the graph
• N = the number of nodes of the graph
• P = the number of connected components
Sequence
1
Step 1 : Print x
Step 2 : Print y
Cyclomatic Complexity = E - N 2
+2P
= 1-
2+2
=1
CYCLOMATIC COMPLEXITY EXAMPLE
Selection
1
Step 1 : IF X>0
Step 2 : PRINT “X is Positive”;
Step 3 : ELSE PRINT “X is Negative”;
Step 4 : PRINT X
2 3
Cyclomatic Complexity = E - N
+2P
= 4-4+2 4
=2
1
9 8
1
CYCLOMATIC COMPLEXITY
EXAMPLE 2
Repetition
Step 1 : PrintDifferent(int x, int y)
3
Step 2 :{
Step 3 : while(x>y){
Step 4 : if (x>0)
Step 5 : x=x-y; 4
Step 6 : else y=y-x;
Step 7 :} 6
Step 8 : print x, y;
Step 9 : } 7
9 8
1
• Writing proposals
• Planning the project
• Scheduling the project
• Estimating the cost of the project
• Monitoring and reviewing the
project’s progress
• Selecting, hiring, and evaluating
personnel
• Writing reports and giving
presentations
The 4 P’s in Project
Management
• The Stakeholders
• Team leaders
• The software team
Stakeholders
Senior managers who define the business issues that often
have significant influence on the project.
Need to know,
The product scope
Problem decomposition
The Product Scope
Determination of software scope: Scope is defined by,
● Context:
● How does the software to be built fit into a larger system,
product, or business context
● what constraints are imposed as a result of the context?
● Information objectives:
● What customer-visible data objects are produced as output
from the software?
● What data objects are required for input?
• cost
• delivery deadline
• budgets and costs
• application domain
• technology to be
implemented
• system constraints
• user requirements
• available resources
• product quality
Day School Activity
Day School Activity 5.5 GROUP ACTIVITY
• Communication Skills
• Organizational Skills
• Team Building Skills
• Leadership Skills
• Technological Skills
Thank you