The authors consider B/sub c/-trees in a centralized system with large main memory, and show that in some cases the join operation using B/sub c/-trees out performs other join techniques. The results can be used for estimating the cost of join using B/sub c/-trees and then making a decision regarding the most efficient join technique to be used.>

In verification of n-bit CMOS memories it is usual to supply a test address sequence having n2/sup /n transitions, one for each ordered pair of n-bit words which differ in a single bit. From an inductive definition of a sequence with these properties, a succession of algorithms yielding the logic circuit of a next-state generator for the sequence is developed. Proving these algorithms equivalent demonstrates the correctness of the circuit rigorously.>

In Knuth's algorithm for multlprecision integer division, the estimated quotient digit may differ from the correct value by 2 in rare cases.We derive the entire range of cases in which this situation can occur for a given radix.The results are expected to be useful in testing realizations of the algorithm in computer algebra systems and elsewhere.

In teaching Pascal in our basic programming course since 1975, we have developed a teaching order using a sequence of language subsets, similar in concept to the SP/k, SF/k, and PS/k systems of Holt and Hume. Our scheme introduces each programming idea in as general a context as possible, and presents the elements of the Pascal-S subset (Wirth) before the rest of the language. It is designed for a concentrated presentation together with elements of discrete mathematics, combinatorics, and concepts of program design, for students with a basic course in Fortran as background.