Concept of Abstract Data Types
Data types:
A data type is the most basic and the most common classification of data. It is this through which the compiler gets to know the form or the type of information that will be used throughout the code. So basically data type is a type of information transmitted between the programmer and the compiler where the programmer informs the compiler about what type of data is to be stored and also tells how much space it requires in the memory. Some basic examples are int, float, string etc.
A data type is the most basic and the most common classification of data. It is this through which the compiler gets to know the form or the type of information that will be used throughout the code. So basically data type is a type of information transmitted between the programmer and the compiler where the programmer informs the compiler about what type of data is to be stored and also tells how much space it requires in the memory. Some basic examples are int, float, string etc.
Data Object:
A data object is a region of storage that contains a value or group of values. Each Value can be accessed using its identifier or a more complex expression that refers to the object. In addition, each object has a unique data type. The data type of an object determines the storage allocation for that object and the interpretation of the values during subsequent access.
A data object is a region of storage that contains a value or group of values. Each Value can be accessed using its identifier or a more complex expression that refers to the object. In addition, each object has a unique data type. The data type of an object determines the storage allocation for that object and the interpretation of the values during subsequent access.
Data
structure: (D-Data,
A-Axioms, O-Operations)
Data structure is the structural representation of logical relationships between elements of data. In other words a data structure is a way of organizing data items by considering its relationship to each other. Data structure mainly specifies the structured organization of data, by providing accessing methods with correct degree of associativity. Data structure affects the design of both the structural and functional aspects of a program.
Algorithm + Data Structure = Program
Data Structures=Organized Data+ Operations
We can also define data structure as a mathematical of logical model of a particular organization of data items. The representation of particular data structure in the main memory of a computer is called as storage structure. The storage structure representation in auxiliary memory is called as file structure. It is defined as the way of storing and manipulation data in organized form so that it can be used efficiently.
Data structure is the structural representation of logical relationships between elements of data. In other words a data structure is a way of organizing data items by considering its relationship to each other. Data structure mainly specifies the structured organization of data, by providing accessing methods with correct degree of associativity. Data structure affects the design of both the structural and functional aspects of a program.
Algorithm + Data Structure = Program
Data Structures=Organized Data+ Operations
We can also define data structure as a mathematical of logical model of a particular organization of data items. The representation of particular data structure in the main memory of a computer is called as storage structure. The storage structure representation in auxiliary memory is called as file structure. It is defined as the way of storing and manipulation data in organized form so that it can be used efficiently.
Data
structure mainly specifies the following four things
1. Organization of data
2. Accessing methods
3. Degree of associativity
4. Processing alternatives for information
Data Structure is a systematic way to organize data in order
to use it efficiently. Following terms are the foundation terms of a data
structure.
Interface
Each data structure has an interface. Interface represents
the set of operations that a data structure supports. An interface only
provides the list of supported operations, type of parameters they can accept
and return type of these operations.
Implementation
Implementation provides the internal representation of a
data structure. Implementation also provides the definition of the algorithms
used in the operations of the data structure.
Advantages
of data structures
- Promotes re-use of important functions on data.
- Implementation is hidden from the user to allow concentration on high level solutions of the problem at hand.
- Prepackaged data structures by third party vendors can be guaranteed to be terribly efficient, probably the best solution for low level data manipulation. The more optimized libraries that we use in our software, the greater the potential exists for faster, more powerful results with the minimum of coding.
- A standard set of functions provides a separation from low-level implementation to the high level application, giving room for enhancing/modifying the data structure functions to other methodologies if the need be without touching the application code.
