# Data Structure

### The way to organize the data

Data Structure2020-10-06T17:14:03+05:30

## Introduction to Data Structure

Data Structure is a way to organize or to store the data in efficient way in computer so that it can be retrieved efficiently (quickly) whenever it needed.

OR

Data Structure is a representation of logical relationship exiting between individual elements of data.

For example: Data stored in dictionary always organized in sorted order so that they can be searched very easily when reader wants to find some words from it. On the other hand, think if the data do not stored in sorted order in word dictionary then how much it might be difficult for everyone to find something from dictionary. In this case, Dictionary is useful for us only when all information that we want from dictionary is organized in proper manner so that it can be searched effectively in short time.

• Data Structure study covers the following points
• Amount of memory require to store data.
• Amount of time require to process data.
• Representation of data in memory.
• Operations performed on that data.

## Different Types of Data Types

A data type is a classification of data, which can store a specific type of information. Data types are primarily used in computer programming, in which variables are created to store data. Each variable is assigned a data type that determines what type of data the variable may contain.

1. Primitive Data Types
2. Non Primitive Data Types

Classification of Data Types

### Primitive Data Types

These kind of data types  are also called as inbuilt data types as they are supported by programming languages because they are predefined in programming languages like C, JAVA, etc..

For example: character, boolean, integer, float, double are the primitive data types.

### Non-Primitive Data Types

Non-Primitive data types are defined by programmer and not by the programming languages. By using Primitive data types programmer can define non-primitive data types. When an application requires a special kind of data which is not available as a built-in data type, then it is the programmer’s responsibility to implement his own kind of data.

For example: array, structure,  union, lists etc..

## Classification of Data Structures

Important Topics :

Linear Vs Non Linear Data Structure – Difference

Find Full Material and GTU Previous Year Question Papers Here..

## PUSH and POP operations on stack using an array with C program

By |December 15th, 2016|

## Linear Search and Binary Search Algorithm in Data Structure

By |December 20th, 2016|

## What is the difference between Binary Tree, Binary Search Tree, AVL Tree, 2-3 Tree and B-trees?

By |January 1st, 2017|

## Infix to Postfix conversion using Stack with C Program

By |July 14th, 2017|