Home → Magazine Archive → June 1982 (Vol. 25, No. 6) → Modularity and the sequential file update problem → Abstract

Modularity and the sequential file update problem

By Michael R. Levy

Communications of the ACM, Vol. 25 No. 6, Pages 362-367
10.1145/358523.358536



The best-known solution to the sequential file update problem is the balanced-line algorithm. Here, the problem is solved using abstract data types and the resulting Cobol program illustrated. It is suggested that the program's modular decomposition aids in the development of the solution.

The full text of this article is premium content

0 Comments

No entries found