Abstract
Sets are mathematical objects with well-studied properties and operations in modern mathematics. Sets and their operations are used extensively across a wide range of disciplines. Like abstract data types, a set is a collection of objects, usually of the same type, subject to the usual set operations such as union, intersection etc. To start with, let us illustrate how sets may be used as data types by considering a simple application.
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.
Bibliographic Notes and Further Reading
Feldman, J. A. and Rovner, P. D. (1969). ‘An algol-based associative language’, CACM, Vol 12, No. 8, pp. 439–449.
Schwartz, T. J. (1973). On Programming: An Interim Report on the SETL Project, Courant Institute, New York.
Author information
Authors and Affiliations
Copyright information
© 1990 Manoochehr Azmoodeh
About this chapter
Cite this chapter
Azmoodeh, M. (1990). Abstract Data Type Sets—I. In: Abstract Data Types and Algorithms. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-21151-7_5
Download citation
DOI: https://doi.org/10.1007/978-1-349-21151-7_5
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-51210-4
Online ISBN: 978-1-349-21151-7
eBook Packages: Computer ScienceComputer Science (R0)