Abstract
These are all static data structures in the sense that their structure and storage requirements must be specified when the program is coded. For arrays, however, this size can vary within the limits prescribed by the language environment. Arrays also have a certain dynamic aspect due to the indexed access to its elements. Ifwe want to manage a large amount of data in main memory, then initially arrays are our only option. However, arrays also suffer from the restriction of static size and structure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Böszörményi, L., Weich, C. (1996). Dynamic data structures. In: Programming in Modula-3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60940-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-60940-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64614-0
Online ISBN: 978-3-642-60940-4
eBook Packages: Springer Book Archive