WHITE BOX TESTING

Using white box testing method, the software engineer can drive cases that1) Guarantee that all independent paths within a module have been exercised at least once.2) Exercise all logical divisions on their true and false sides.3) Exercise all loops at their boundaries and within their operational bounds.4) Exercise internal data structures to ensure their validity.

CONTROLE STRUCTURE TESTING : This alludes to white box-testing method.1) Basic path Testing: This enables the tester to drive a logical complexity measure of a procedural design and are this measure as a guide for defining a basis set of execution paths. Test cases derived to exercise the basis set are guaranteed to execute every during testing.We may are ‘FLOW GRAPH NOTATION’ as a useful loop for understanding control flow and illustrating the approach.We can are ‘CYLLOMETRIC COMPLEXITY’ is a software metric that provides a quantitative measure of the logical complexity of a program. Here, the value computed for cyclometric complexity defines the No. of independent paths is the basis set of program and provides as with the upped bound for the No. of tests that be conducted to ensure that all statements have been exercise at least once.

window.google_render_ad();

GRAPH METRIX 2) Condition Testing :This test case design method exercise the logical condn’s contained in the program module. It has adv. like (i) measurement of test coverage of a cond’n is sample. (ii) The test coverage of condn’s is a program provides guidance for the gen of additional tests for the program.BRANCH TESTING : for a compound condn’s C, the true and false branches of C and every sample cond’n in C need to be exec. at least onceDOMAIN TESTING, required there of four tests to be derived for a relational exprsm.3) Data flow TestingThis method selects test paths of a program according to the locations of defines and cases variable in the program.4) Loop Testing:1) Start at the internal loop set all other loops to2) Conduct simple test for investment loops while holding the outer loops their min interaction parameter ( loop counter) values. Add other tests for out of range or excluded values.3) Work outward, conducting test for the next loops but keeping all other outer loops at min. values.4) Continue till the last loop.

BLACK – BOX TESTING

Black box testing attempt to final errors in the following categories:1. I correct or missing Fns2. Interface errors.3. Errors in data structures or external data base access.4. Behavior or performance errors.5. Initialization and termination errors

I Graph Based Testing:First step in black box testing is to understand the objects that are modeled in s/w and the relationships that connect their object. Testing begins with creating a graph of imp. Objects and their relationship and then devising a series of tests that will cover the graph so that each object and relationship is exercised and errors are uncovered.We start with creating a graph

Directed link ----> relations bet. ObjectsNode weight ----> attributes of the objects.Nodes ----> Objects.Graph based testing begins with the defn of all nodes and node weights. ie, objects and attributes are identified. The data model can be used as a starting point.Based on this, we can conduct the following behavioral testing methods: Transaction flow modelling Finite state modeling Data flow modeling.Now we must go for node coverage and link coverages to ensure that all objects and their relations are executed.

window.google_render_ad();

II Equivalence partitioning:Here the ip domain is divided in to classes of data from which test cases can be derived. An ideal test case is one which single – handedly uncovers a class of errors. If the ip class defines a range, one valid and two invalid classes are defined. If an ip cond,n req. a spec. value, one valid and two invalid equivalence classes are defined. If an ip condn specifies a member of set. One valid and one invalid equivalence class are defined. If an ip cond’n is one valid and one invalid class are defined.III Boundary Value Analysis :Boundary value analysis leads to a selection of teat cases that exercise bounding values. BVA leads to the selection of test cases at the edges of the class. BVA derives test cases from the output domain. If ip specifies a range of values bounded by a & b, then test cases should be designed with values a and b and just above and below a and b. Test care should be designed to create an op report that produces the max (win) allowable no. of table entries.III Boundary Value Analysis : (Back – to – back)And when the reliability of the s/w is very critical. In such situations, redundant s/w and L/W are used to minimize the possibility of error. When redundant s/w is dev, sep. s/w engg. Teams dev. independent versions of an applies using the same spec. In such cases each version can be tested with the same test data to ensure that all provide identical output.If the op from each version is the same, it is assumed that all implementations are correct. If the op is different, each of the applies is investigated to det. if a defect is one or more versions is responsible for the difference.If the spec. from which all versions have been dev. is in error. If each of there versions will provide identical but incorrect results, condn’s testing will fail to detect the error.