Skip Navigation

The Computer Journal 1976 19(1):92; doi:10.1093/comjnl/19.1.92
© 1976 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Samson, W. B.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Testing overflow algorithms for a table of variable size

W. B. Samson *

Dundee College of Technology, Bell Street, Dundee DD1 1HG

Large scatter tables which vary in size with time present a problem from the point of view of overflows. This paper describes a program which simulates overflows and indicates which table sizes are to be avoided when the size of the table is to be altered.

Received February 1975.

* Dundee College of Technology, Bell Street, Dundee DD1 1HG


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.