Abstract Concept Vs. Implementation
As described here, a collection and the various kinds of collections are abstract concepts. There exists in the literature considerable confusion between the abstract concepts of computer science and their specific implementations in various languages or kinds of languages. Assertions that collections, lists, sets, trees, etc. are data structures, abstract data types or classes must be read with this in mind. Collections are first and foremost abstractions that are useful in formulating solutions to computing problems. Viewed in this light, they retain important links to underlying mathematical concepts which can be lost when the focus is on the implementation.
For example, a priority queue is often implemented as a heap, while an associative array is often implemented as a hash table, so these abstract types are often referred to by this preferred implementation, as a "heap" or a "hash", though this is not strictly correct.
Read more about this topic: Collection (abstract Data Type)
Famous quotes containing the words abstract concept, abstract and/or concept:
“But the abstract conception
Of private experience at its greatest intensity
Becoming universal, which we call “poetry,”
May be affirmed in verse.”
—T.S. (Thomas Stearns)
“But the abstract conception
Of private experience at its greatest intensity
Becoming universal, which we call “poetry,”
May be affirmed in verse.”
—T.S. (Thomas Stearns)
“Teaching Black Studies, I find that students are quick to label a black person who has grown up in a predominantly white setting and attended similar schools as “not black enough.” ...Our concept of black experience has been too narrow and constricting.”
—bell hooks (b. c. 1955)