Data Structures: Difference between revisions
Jump to navigation
Jump to search
| Line 7: | Line 7: | ||
All data structures used to represent data in the memory of a computer are at essentially <span id='Set'></span>'''sets'''. Unlike a mathematical [[Set|set]], the sets manipulated by computers are '''finite''', and their composition change in time, so they are called '''dynamic'''. We know from mathematics that the elements of a set are distinct. Data structure sets also consist of distinct elements, if we conceptualize the fact that the elements are maintained in distinct memory locations. | All data structures used to represent data in the memory of a computer are at essentially <span id='Set'></span>'''sets'''. Unlike a mathematical [[Set|set]], the sets manipulated by computers are '''finite''', and their composition change in time, so they are called '''dynamic'''. We know from mathematics that the elements of a set are distinct. Data structure sets also consist of distinct elements, if we conceptualize the fact that the elements are maintained in distinct memory locations. | ||
A dynamic set that allows | A dynamic set that allows ''insertion'' of new elements, ''deletion'' of existing elements and ''membership testing'' for a specific element is called a '''dictionary'''. | ||
Revision as of 02:23, 10 August 2018
Internal
Overview
All data structures used to represent data in the memory of a computer are at essentially sets. Unlike a mathematical set, the sets manipulated by computers are finite, and their composition change in time, so they are called dynamic. We know from mathematics that the elements of a set are distinct. Data structure sets also consist of distinct elements, if we conceptualize the fact that the elements are maintained in distinct memory locations.
A dynamic set that allows insertion of new elements, deletion of existing elements and membership testing for a specific element is called a dictionary.