Section 2 surveys efficient parallel algorithms for bookkeeping operations such as compacting an array by squeezing out its dead elements, for evaluating algebraic expressions, for searching a graph and decomposing it into various kinds of components, and for sorting, merging and selection.