Data structure and algorithm design - Introduction (b)

type of data

Type (Type) is a collection of a set of values

Data type (Data Type) is set and defining a set of worth to give a set of operations on the value of lumped

Inherent data type, non-atomic structure type and structure type

Abstract Data Types (Abstract Data Type, ADT)

• A mathematical model (data structure) defined on the model and a set of operations
• Details the essential characteristics of the so-called abstract (Abstract) is out of the problem rather than nature, is a summary of the specific matters

Abstract Data (Data Abstraction)

• When treated with an entity refers to the procedures described ADT, which emphasizes essential characteristics, it can be completed and external functions and user interface

Data encapsulation (Data Encapsulation)

• Characteristic is the external entities and their internal implementation details of the separation , and to hide the external user which internal implementation details

ADT = (D, S, P ), D is a data object, S is set on the relationship between the D, P = {E is D _{. 1} , E ₂ | E _{. 1} , E ₂ the basic operation of the set ∈ RealSet}