Introduction to Data Structures

Before understanding data structures you should first know what actually Data is.

Data is a collection of numbers, alphabets or symbols. The data can be stored in physical devices like in notebooks and in computer memory in binary format.

A computer is incomplete without data. When data is being processed we get the information.

Like if you need to know the performance of cricket then you need to know his each and every match scored data. Then only you can calculate his performance.

To store the data in a way so that it can easily accessible or used that actually you will learn in Data Structures.

Type of Data Structure

Data structures are of following types.

  1. Linear
  2. Non-Linear
  3. Homogenous
  4. Non-homogenous
  5. Static
  6. Dynamic

Linear Data Structures

In linear data structures all the values are arranged in linear way. Like Array, Linked List, Stack and Queue. All the elements are connected with one another.

Non-linear Data Structures

It is opposite to linear one. In non-linear data structures all the values are arranged in order. Like Tree, Graph, Table and Sets.

Homogenous Data Structures

In homogenous data structure all the values are of same type. Just like in array all the values of same type.

Non-homogenous Data Structures

In non-homogenous data structure values can be of different types. Like structure and classes.

Static Data Structures

In static data structure memory allocation is done before the execution of program and can’t be change later. In this data structure there may be loss of memory or shortage of memory. Like Array is static data structure where memory is allocated at compile time and can’t be altered.

Dynamic Data Structures

In dynamic data structures memory allocation is done during program execution so there’s no any wastage or memory. Memory can be increased according to need.

Leave a Reply