The implementation part is left on developers who decide which technology better suits to their project needs.įor example, a stack ADT is a structure which supports operations such as push and pop. The functional definition of a data structure is known as ADT (Abstract Data Type) which is independent of implementation. First, how the data will be stored, and second, what operations will be performed on it? As data structure is a scheme for data organization so the functional definition of a data structure should be independent of its implementation. A data structure should be seen as a logical concept that must address two fundamental concerns. If the data is stored in well organized way on storage media and in computer's memory then it can be accessed quickly for processing that further reduces the latency and the user is provided fast response.ĭata structure introduction refers to a scheme for organizing data, or in other words a data structure is an arrangement of data in computer's memory in such a way that it could make the data quickly available to the processor for required calculations.

Introduction to Basic Data Structures and Algorithmsīefore introducing data structures we should understand that computers do store, retrieve, and process a large amount of data.

Introduction to Basic Data Structures and Algorithms.

Use of basic data structures