Abstract
A file is collection of records; a structured file is a collection of records each having the same structure. A file may thus be thought of as a type of data structure. Unlike an array or record, a file does not have a fixed size; it can even be empty. Writing to a file alters its size. A data structure whose size can be altered by inserting and deleting elements is called a dynamic data structure.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1990 Percy Mett
About this chapter
Cite this chapter
Mett, P. (1990). Dynamic Data Structures. In: Introduction to Computing. Palgrave, London. https://doi.org/10.1007/978-1-349-08039-7_9
Download citation
DOI: https://doi.org/10.1007/978-1-349-08039-7_9
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-39336-9
Online ISBN: 978-1-349-08039-7
eBook Packages: Palgrave Social & Cultural Studies CollectionSocial Sciences (R0)