An abstract data type specifies values and operations independently of their storage. A FIFO queue has ordered sequences as its abstract values; an array and a linked list can represent those same values. A representation invariant identifies valid storage states, and an abstraction function says what each valid state means.[ref]

There are no discussions about this article yet.

Articles by others on the same topic (NaN)

There are currently no matching articles.