Some tricky question answers

1. Define the following along with examplesa. Boundary Value testingb. Equivalence testingc. Error Guessingd. Desk checkinge. Control Flow analysisAnswer:1-a) Boundary value Analysis: -A process of selecting test cases/data byidentifying the boundaries that separate valid and invalid conditions. Tests areconstructed to test the inside and outside edges of these boundaries, in addition tothe actual boundary points. or A selection technique in which test data are chosen tolie along “boundaries” of the input domain [or output range] classes, data structures,procedure parameters, etc. Choices often include maximum, minimum, and trivialvalues or parameters.E.g. - Input data 1 to 10 (boundary value)Test input data 0, 1, 2 to 9, 10, 11
1-b) Equivalence testing: -The input domain of the system is partitioned into classesof representative values, so that the no of test cases can be limited to one-per-class,which represents the minimum no. of test cases that must be executed.E.g.- valid data range: 1-10Test set:-2; 5; 14
1-c) Error guessing: -Test data selection technique. The selection criterion is to pickvalues that seem likely to cause errors Error guessing is based mostly uponexperience, with some assistance from other techniques such as boundary valueanalysis. Based on experience, the test designer guesses the types of errors thatcould occur in a particular type of software and designs test cases to uncover them.E.g. - For example, if any type of resource is allocated dynamically, a good place tolook for errors is in the de-allocation of resources. Are all resources correctly deallocated,or are some lost as the software executes?
1-d) Desk checking: -Desk checking is conducted by the developer of the system orprogram. The process involves reviewing the complete product to ensure that it isstructurally sound and that the standards and requirements have been met. This isthe most traditional means for analyzing a system or program.
1-e) Control Flow Analysis: -It is based upon graphical representation of theprogram process. In control flow analysis; the program graphs has nodes whichrepresent a statement or segment possibly ending in an unresolved branch. Thegraph illustrates the flow of program control from one segment to another asillustrated through branches .the objective of control flow analysis is to determine
the potential problems in logic branches that might result in a loop condition orimproper processing .