# Page 1 Page 2

**Classification of data structures**

Fig

**The data structures can be classified into of following two types:**

**Primitive Data Structures****Non Primitive Structures.**

** ****Primitive Data Structures**

** ****These are basic data structure and are directly operated upon by the machine instructions. These in general have different representation on different computers. Integers, floating point numbers character constants, string (group of characters) fall in this category.**

** ****Non Primitive data Structures**

**These are more sophisticated data structures. These are derived from the primitive data structures.**

** ****The non primitive data structure emphasize on the structuring of a group of homogeneous (same type) or heterogeneous (different type) data items.**

**Arrays, list and files belong to this category.**

**Algorithm**

**Algorithm is solution of a problem in general English like sentences in finite number of steps.**

** ****It is the step wise sequential representation of a solution. These steps can be implemented in any programming language. **

**Properties:**

**It should be simple.****It should be clear and written without ambiguity.****It should be of finite number of steps.****Should not stick to some particular language. i.e. it should be independent of any programming language.****For separate procedures and functions different algorithm should be written.****It should be able to handle the entire situation/all conditions.****Algorithm should be such that it can be easily understood by all the users.**