what is abstract data type?
Answers
Answered by
0
Answer:
Abstraction provides the modularity (Splitting a program in to many modules is called modularity). The representation for Abstract data types (ADT) is classes (Structures).
Explanation:
Answered by
0
ANSWER:- • ADTs are a mathematical representation of data types used in computer science. In terms of possible values, operations that could be performed on this type of data, and the behaviour of those actions, an abstract data type is characterised by its behaviour (semantics) from the perspective of a user.
EXPLENATION:- • An object's behaviour can be described by a set of values and a set of actions, and this behaviour is known as an abstract data type (ADT). The definition of ADT merely specifies the actions that must be taken, not how they must be carried out.
• It is unclear what algorithms will be utilised to carry out the operations and how the data will be structured in memory.
The implementation of a data type is not required knowledge for the user.
1. listing ADT
The data is often kept in a list with a head structure that includes a count, pointers, and the address of the compare function needed to compare the data in key sequence.
2. Stack ADT
The pointer to the data is stored in the Stack ADT Implementation rather than the actual data itself.
The stack ADT receives the address that the application uses to allocate memory for the data.
3. List ADT in a queue
The basic design of the stack abstract data type is followed by the queue abstract data type (ADT).
A void pointer to the data and a link pointer to the subsequent element in the queue are both included in each node.
EXPLENATION:- • An object's behaviour can be described by a set of values and a set of actions, and this behaviour is known as an abstract data type (ADT). The definition of ADT merely specifies the actions that must be taken, not how they must be carried out.
• It is unclear what algorithms will be utilised to carry out the operations and how the data will be structured in memory.
The implementation of a data type is not required knowledge for the user.
1. listing ADT
The data is often kept in a list with a head structure that includes a count, pointers, and the address of the compare function needed to compare the data in key sequence.
2. Stack ADT
The pointer to the data is stored in the Stack ADT Implementation rather than the actual data itself.
The stack ADT receives the address that the application uses to allocate memory for the data.
3. List ADT in a queue
The basic design of the stack abstract data type is followed by the queue abstract data type (ADT).
A void pointer to the data and a link pointer to the subsequent element in the queue are both included in each node.
Similar questions