{'fraction_non_alphanumeric': 0.011058451816745656, 'fraction_numerical': 0.0, 'mean_word_length': 4.711711711711712, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Data Structure & Algorithm for Combination Tree To Generate Test Case

The combinations play an important role in software testing. Using them we can generate the pairs of input parameters for testing. However until now we have the tabular representations for combination pairs or simply the charts for them. In this paper we propose the use of combination trees which are far easier to visualize and handle in testing process. This also gives the benefits of the remembering the combination of input parameters which we have tested and which are left, giving further confidence on the quality of the product which is to be released.