Abstraction

(redirected from Abstract data type)
Also found in: Dictionary, Thesaurus, Medical, Acronyms, Encyclopedia, Wikipedia.

Abstraction

Taking from someone with an intent to injure or defraud.

Wrongful abstraction is an unauthorized and illegal withdrawing of funds or an appropriation of someone else's funds for the taker's own benefit. It may be a crime under the laws of a state. It is different from Embezzlement, which is a crime committed only if the taker had a lawful right to possession of the money when it was first taken.

See: concept, generality, idea, impalpability, larceny, notion, preoccupation, vision
References in periodicals archive ?
An abstract data type is a set of declarations regarding the functionalities of a collection of objects.
Because it is not a primitive type, the C# compiler assumes that the type is an abstract data type and searches the code looking for the declaration of the Person data type.
Every algorithm is implemented as an abstract data type which provides a method to execute the algorithm as a whole.
The proposed abstract data types may be used as column types in conventional relational DBMSs, or they may be integrated in object-oriented or object-relational DBMSs.
For clietn-server, in which an attribute of an O/C is of an abstract data type and hence requires reference to another O/C for its realization, the arrow from a circle internal to the O/C directed to the name of the server O/C is useful (Figure 14(b)).
Abstract data types provide a mechanism for packaging and specifying data structures in the component libraries that Gries envisions.
Abstract data types and the development of data structures.
The sessions for Saturday take you through a bewildering whirl of arrays, decision constructs, and abstract data types.
Support for object-oriented features, such as large objects, structured types and user-defined abstract data types (ADT) for flexibility.
However, SQL3 offers the ability to declare abstract data types (ADTs) that let programmers capture application-specific behavior as part of the database.
He covers what computation is; elementary computations; visualizing abstractions; growth and decay; forks in the road; text, documents, and DNA; designing programs; data analysis; flatland; self-similarity and recursion; organizing data; networks; and abstract data types.
Topics discussed include abstract data types, the stack, queues, recursion, lists, binary search trees, priority queues, heaps and graphs and sorting and searching algorithms and each chapter includes illustrations and sample code as well as student exercise questions.