DATA STRUCTURE
INTRODUCTION
What is Data Structure?
A data structure is a way of storing data in a computer so that it can be used efficiently and it will allow the most efficient algorithm to be used. The choice of the data structure begins from the choice of an abstract data type (ADT). A well-designed data structure allows a variety of critical operations to be performed, using as few resources, both execution time and memory space, as possible. Data structure introduction refers to a scheme for organizing data, or in other words it 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.
A data structure should be seen as a logical concept that must address two fundamental concerns.
- First, how the data will be stored, and
- Second, what operations will be performed on it.
Classification of Data Structures:
- Simple data structure
- Compound data structure
- Linear data structure
- Nonlinear data structure
[Fig 1. Classification of Data Structures]
Simple Data Structure: Simple data structure can be constructed with the help of primitive data structure. A primitive data structure used to represent the standard data types of any one of the computer languages. Variables, arrays, pointers, structures, unions, etc. are examples of primitive data structures.
Compound Data structure: Compound data structure can be constructed with the help of any one of the primitive data structures and it is having a specific functionality. It can be designed by user. It can be classified as
- Linear data structure
- Non-linear data structure
Linear Data Structure: Linear data structures can be constructed as a continuous arrangement of data elements in the memory. It can be constructed by using array data type. In the linear Data Structures the relationship of adjacency is maintained between the data elements.
Non-linear Data Structure: Non-linear data structure can be constructed as a collection of randomly distributed set of data item joined together by using a special pointer (tag). In non-linear Data structure the relationship of adjacency is not maintained between the data items.
PRESENTED BY:- Subhasmita Pattnaik (Lecturer in Computer sc.)
