What is Basic Types of Data Structure?

Data Structure is a way of collecting and organizing data in such a way that we can perform operations on these in an effective way.

Basic types of Data Structure

1) Anything that can store data can be called primitive data structure. For example: Integer, char etc.

2) Data structure which are used to store large and connected data are called abstract data structure. For example: Linked list, tree, graph etc.

Data structure can also be classified on the basis of following criteria

1) In linear data structure, the data items are arranged in a linear sequence. Example: array.

2) In non linear data structure, the data items are not arranged in a sequence. Example: Tree, graph.

Algorithm

An algorithm is a finite set of instructions or logic written in order to accomplish a certain predefined task. It is not the complete code, it is just the core logic (solution) of a problem which can expressed either as an informal high level description as pseudocode.

Every Algorithm must satisfy the following properties:

i) Input

ii) Output

iii) Definiteness

iv) Finiteness

v) Correctness