Tuesday, 7 November 2017

What do you mean by Data Structures? Discuss about its different types. 

It is a representation of logical relationship between individual elements of data. It defines a way of organizing all data items into computer memory and their relationship with each other. To develop a program of an algorithm we should select an appropriate data structure for that algorithm. Therefore, we can represent data structure as follow:

Program  =  Algorithm + Data structure. 

It is said to be linear if its elements form a sequence. We have some linear data structures like an array, stacks, queues and linked lists organize data in linear order. It is said to be non linear if its elements form a hierarchical classification where, data items appear at various levels. We have some non-linear data structures like Trees and Graphs. Tree and graph structures represents hierarchical relationship between individual data elements. Graphs are nothing but trees with certain restrictions removed.

According to the above discussion we classified data structures into two types:

1. Primitive data structures : It is the basic data structures that directly operate upon the machine instructions. These data structure have different representations on different computers. Data structure like Integers, floating point numbers, character constants, string constants and pointers come under this category.

2. Non-primitive data structures : These types of data structures are more complicated and are derived from primitive data structures. They emphasize more on grouping same or different data items with relationship between each data item. Arrays, lists and files come under this category. 

Mukesh Rajput

No comments:

Post a Comment

Mukesh Rajput