answersLogoWhite

0

An Abstract Data Type is an interface that interacts with a data structure.

A Data Structure is an implementation of the ADT.

for example. If you were going to create a linked list you would create an Interface listing all the methods required by the list. Then in the linked list class you would code how the list uses these methods. Hope this helps :)

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

What is the difference between allocation and search data structure?

difference between serch data structure and allocation data structure


What is the difference between data model and schema in database?

As I understand it, a database schema is a physical entity, it describes the structure of exactly how the data is stored and is itself stored by DBMS for reference. Data model, on the other hand, is an abstract representation of database.


What is called representation of data structure in memory?

"Abstract Data Type"


What is the difference between structure and pointer?

A structure is a collection of primitives or other structures. A pointer is a memory address. Comparison of the two is like comparing bowling balls to cinder blocks. You can say that a structure defines the layout of the data, while a pointer points to data that is a particular structure.


What is the difference between data and data structure?

Data structure: An information structure is an arrangement of information considered as one substance. An int, for instance, is a straightforward variable, can't be considered as an information structure, yet an exhibit is an information structure. Data: Information will be data that has been interpreted into a frame that is more advantageous to move or procedure.


What is the difference between binary tree and tree data structure?

binary tree is a specific tree data structure where each node can have at most 2 children nodes. In a general Tree data structure nodes can have infinite children nodes.


Difference types of nonlinear data structure?

Tree, Graphs are the types of nonlinear data structure.


What is the difference between linked list and Ordinary list?

A list is an abstract data structure, usually defined as an ordered collection of data. A linked list refers to a specific implementation of a list in which each element in the list is connected (linked) to the next element.


Difference between data structures and ADT?

Abstract Data Types:ADT is a mathematically specified entity that defines a set of its instances, with:a specific interface - a collection of signatures of methods that can be invoked on an instance,a set of axioms that define the semantics of the methods (i.e., what the methods do to instances of the ADT, but not how)Abstract Data Types (Examples):Lists, TreesStacks, QueuesPriority Queue, Union-FindDictionaryData StructureIn a general sense, any data representation is a data structure.Example: An integerMore typically, a data structure is meant to be an organization for a collection of data items.From: Shoaib Sidhu


What is the difference between OLAP and data mining?

difference between Data Mining and OLAP


What is difference between treeset and treemap?

TreeSet internally implements Balanced Tree Structure whereas TreeMap implements Red Hat Tree Data Structure.


What is the difference between primitive and non primitive data structure?

A primitive data structure is generally a basic structure that is usually built into the language, such as an integer, an array or a linked-list.A non-primitive data structure is built out of primitive data structures linked together in meaningful ways, such as a binary search tree, AVL Tree, Hashtable, etc.