Two iterated algorithms to evaluate the performance of a class of sequential tests are proposed. The goal is equivalent to computing the distribution function of the first passage time for a random walk to cross a one-sided barrier. Limitations on both algorithms are studied, and associated methods to eliminate those limitations when possible are derived. These algorithms are then applied to a PN code acquisition system and a range-sampled radar searching problem. Related computational problems are discussed and numerical results are given.