1. Design testing criteria for the problem of finding the intersection of two co

1. Design testing criteria for the problem of finding the intersection of two convex polygons. given as sequences of points the integer Cartesian plane. The program must also be able to check whether the polygons are convex or not. Take into account. the fact that, even if the vertices have integer coordinates, their intersections may not. 2. Design. testing criteria for the problem of formatting a text according to the following rules: The text is a sequence of characters. The special character 'V is used only for specifying commands.. break. is the “line break” command; the traditional RETURN, however, may also be used. Commands may be combined with braces and to indicate the scope of application of the command. For example, ( b—text…) says to turn the —text-. into boldface. The command for . text is Other. formatting comniands. may be  by the reader. Formatting commands can be nested. Beginnings and ends must match:  more, two consecutive identical Commands negate one another. As an example of the application of these rules, the; text    should be printed as:  yesterday II was tn NY,' bur it was cabling a lot Tie  niultdetect and report formatting errors.  You should:  a complete and detailed formalization of the specification before designing any tests.

You may also like