Skip to main content

Popular posts from this blog

Istqb,cste inforamtions and training centers in India

About istqb:
The ISTQB was officially founded as an International Testing Qualifications Board in Edinburgh in November 2002 and it is responsible for the "ISTQB Certified Tester", which is an international qualification scheme.

ISTQB is the parent body responsible for approving various national boards in addition to other tasks such as defining the syllabi for various certifications.
website url:
www.indiantestingboard.com FAQ :http://208.116.30.129/faq.htm

for examination and preparation and sample question papers available in below link

will be helpful for ISTQB http://india.istqb.org/resources.htm

http://www.geekinterview.com/quiz/Testing

join yahoo groups:
in this group you can ask your queries about istqb examinations and certification related doubts and sample papers to certified testers..foundation level and advance level question keep on raised by members.

ISTQB-India@ yahoogroups. com

CSTE information:

QAI, India, the premier knowledge corporation in the software engineerin…

Equivalence partitioning

Equivalence partitioning:
Equivalence partitioning is a method for deriving test cases. In this method, classes of input conditions called equivalence classes are identified such that each member of the class causes the same kind of processing and output to occur.

In this method, the tester identifies various equivalence classes for partitioning. A class is a set of input conditions that are is likely to be handled the same way by the system. If the system were to handle one case in the class erroneously, it would handle all cases erroneously.

Equivalence partitioning drastically cuts down the number of test cases required to test a system reasonably. It is an attempt to get a good 'hit rate', to find the most errors with the smallest number of test cases.

To use equivalence partitioning, you will need to perform four steps:
Determining conditions to be TestedDefining TestsDesigning test casesIdentifying Final set of Test Cases

Defining Tests

A number of items must be considered when…

Cyclomatic complexity

Cyclomatic complexity is a software metric (measurement). It was developed by Thomas McCabe and is used to measure the complexity of a program. It directly measures the number of linearly independent paths through a program's source code. It is computed using a graph that describes the control flow of the program. The nodes of the graph correspond to the commands of a program. A directed edge connects two nodes if the second command might be executed immediately after the first command.


Definition

M = E − N + 2P

where

M = cyclomatic complexity
E = the number of edges of the graph
N = the number of nodes of the graph
P = the number of connected components.

"M" is alternatively defined to be one larger than the number of decision points (if/case-statements, while-statements, etc) in a module (function, procedure, chart node, etc.), or more generally a system.

Separate subroutines are treated as being independent, disconnected components of the program's control flow graph.