The paper considers the determination of the value of a boolean function by examining its variable. The function's value is deterministically determined by the variables which arc binary and random. A sequential testing procedure of the variables is presented. It is shown that this procedure minimizes the expected number of necessary tests for some classes of functions and probably do so for others. The presence of such problem is described in file searching, reliability systems, switching circuits and graph connectivity.