The SLEXTF-M2 computer program, written in FORTRAN IV, is used for examinations using binomial or polynomial response, i.e., true/false or multiple choice. The subject matter of any one statement is coded by a string of descriptive words that indicate categories. These words are arranged in left-to-right order such that any one descriptor defines a subclass of the class defined by the descriptor to its left. Tests showed that usually six or seven descriptors would normally be sufficient to define the class of a statement, and in this program, a set of ten is invariant, but some on the right may be blank. The data deck contains a random number between -1.0 and +1.0, a title for the output, a list of 24 control descriptors for limiting the selection, the mean and tolerance limit of difficulty of the statements to be selected, the number to be selected, the number of statements from which selection is to be made, and the number of sets to be selected. After an initial screening of the statements for possible selection, examination sets are selected. The first page of output contains the title, a general instruction, and the first 27 statements. The second and third pages contain the next statements, up to 27 per page. This program is invariant in assuming that 81 is the maximum number of statements that will be required. The fourth page of the output contains a string of T and F symbols in three rows of 27 each, corresponding to the logical values of the selected statements. Also, the last random number used is printed, and this can be the starting number in the next use of the program. (For related documents, see TM 002 778, 789, 791-793.) (DB)