ABSTRACT

Software Testing can be described as the process of verifying and validating that a software
application is bug free, meets the Technical requirement as guided by the design and
development of the software and meets user requirement efficiently and effectively by
handling all exceptional and boundary cases. The software testing is not only at finding faults
in the existing software, but also at finding measures to improve the system in term of
efficiency, reliability and usability. The main objective is to evaluate the quality, usability
and performance of software application or program.

In existing system, The Adaptive Partition Testing in test cases are selected randomly from
some partition whose probability of being selected is Adaptively adjusted along the testing
process. Developing purpose using two algorithms MARKOV-CHAIN and REWARD
PUNISHMENT based on adaptive partition testing. The performance of the proposed
algorithms using ten faulty version of three large open source programs. Compared with two
baseline techniques RANDOM TESTING and PARTITION TESTING. The algorithms have
greater efficiency in detecting faults with lower overhead testcase range.

In proposed system, improving parameter setting for the better performance of Adaptive
Partition Testing and improving strong relation between initial probability profile and
performance was found.