answersLogoWhite

0


Best Answer

Abstract Data Type in computing is a set of data along with a set of predefined operations.

The actual data inside the ADT is protected from direct manipulation. The exposed operations is the only way to manipulate the data.

In easier terms, it is very much like (though not limited) to the objects in object oriented programming.

User Avatar

Wiki User

βˆ™ 11y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

βˆ™ 14y ago

Data Type is a characteristic of a datum in programming languages.

Abstract Data Type in computing is an order of a set of data along with a set of operations also.

This answer is:
User Avatar

User Avatar

Wiki User

βˆ™ 8y ago

An abstract data type is any data type that declares a pure-virtual method, or which inherits a pure-virtual method but does not provide an implementation for it.

For example:

shape s; // a 'shapeless' shape

s.draw(); // implausible

Here, shape is an abstract data type. Just as we wouldn't expect to be able to draw a shapeless shape, we wouldn't expect to create one either. Both should be treated as errors by the compiler. This is achieved by making the draw method a pure-virtual method:

struct shape {

virtual void draw()=0; // pure-virtual

// ...

};

Abstract data types are primarily intended to provide interfaces to derived objects. We can do this simply by declaring those methods virtual in the base class, however if we cannot reasonably provide an implementation for an interface, that interface must be declared pure-virtual, thus rendering the entire base class an abstract data type.

The opposite of an abstract class is a concrete class. Only concrete classes can be instantiated in their own right, abstract classes cannot (we can only derive from them).

This answer is:
User Avatar

User Avatar

Wiki User

βˆ™ 11y ago

ADT is a logical description and data structure is concrete. ADT is the logical picture of the data and the operations to manipulate the component elements of the data. Data structure is the actual representation of the data during the implementation and the algorithms to manipulate the data elements. ADT is in the logical level and data structure is in the implementation level.

This answer is:
User Avatar

User Avatar

Wiki User

βˆ™ 12y ago

Abstract is the data type which can be used at method and class level... The abstract keyword which we used at method level makes that method as abstract means not giving implementation for that method.. the abstract keyword which used at the class level , restrict developers not to create the object of that class.

This answer is:
User Avatar

User Avatar

Wiki User

βˆ™ 13y ago

Abstract is not a datatype but a modifier. Abstract can be used in 2 places:

Methods: If a method is termed abstract it means that the current class does not provide an implementation for this method and the first concrete subclass will do the same.

Classes: Any class that has one or more abstract methods has to be abstract. If a class is abstract it means that the implementing class has to provide an implementation for one or more of the abstract methods of this class.

This answer is:
User Avatar

User Avatar

Wiki User

βˆ™ 9y ago

It is a description of what the data stores and what operations you can do on it, without going into details about the actual implementation (i.e., about the data structures). For more details, the Wikipedia article on "abstract data types" has a good summary.

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is an abstract data structure?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is called representation of data structure in memory?

"Abstract Data Type"


What is the difference between data structure and abstract data type?

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 :)


What is concurrent object?

A concurrent object is an abstract data type that permits concurrent operations that appear to be atomic. It can be implemented as a data structure in shared memory and a set of algorithms that manipulate the data structure using atomic synchronization primitives.


Is built-in data-type are abstract data-types in java?

All built-in data types are not abstract data types.


Is a linked list a physical data structure?

Physical data structures are how data is organized on a hardware storage device, and therefore how they appear to the computer. Logical or virtual data structures are software-based objects, and how the user or program sees it. Although many file systems use a type of linked list format for storing information, a linked list is used for both hardware and software purposes, and therefore it cannot fall under either the physical or virtual data structure classification.


What are the subject-matters of data structure?

types of data structure types of 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.


How do you amend a data structure?

How do you amend a data structure?


How do abstract data from medical records?

To abstract data from the medical records, simply go to the medical files in question to retrieve the information.


What is the difference between allocation and search data structure?

difference between serch data structure and allocation data structure


What is the weakness of Data structure diagram?

weakness of data structure diagrams


What is a homogeneous data structure and why is this a weakness for RDBMS?

in homogeneous data structure all the elements of same data types known as homogeneous data structure. example:- array