Understanding Data Structure Basics And It's Operations



Data Structure -  is a way to storing and organizing data values into memory.

Data Structure provides different algorithms with their advantages and disadvantages, programmer has to decide which one will better according to the requirement. 


We will learn different types of data structures and their operations in next chapter, some of them are  Arrays, Linked List, Stack, Queue, Tree etc.

Data structures are widely used in programming applications and systems applications such as  graphics, Operating system, compiler designing etc.

In this chapter we will discuss about use/advantages of data structure, different types and its operations.

Advantage of Using Data Structure

In real life applications complexity increasing day by day so that storing high amount of data in memory and searching it on demand becoming nightmare. Data Structure algorithms deals with such complexities very efficiently. 

Let's understand with some real life problems ...

1.
There could be billion files per entity and processor may fail to deal with high amount of data.  

- Data Structure storing data algorithm increases the processing speed ex:- List,stack,queue,tree.

2.
An application can be used by multiple users and searching specific record in short time is not that easy for application.

-Data Structure searching algorithms are very much efficient to search data  example:   linear search,binary search etc.

3.
Data Structure defines many sorting algorithms that increase the searching performance of system examples - Bubble sort, quick sort, merge sort etc.

4.
Data Structure is reusable complied form of Ds implementation for one can be use with other client as well.

Types of Data Structure

Data Structure stores and organize the data in memory, On the basis of data type we can divide data structure in two different parts.


1.  Primitive


When data structure stores pre-defined data type values into memory known as primitive data structures.


 int a = 2;

 char b= 'c';

 float f = 3.14;
2.  Non-Primitive

Non-primitive data structure stores data in form of objects. Objects are the collection of different pre-defined data types. User creates such objects, struct, enum are the datatypes that can create objects.


struct student {


char name[10];


int age;


float marks;


} stud;
In this example student is the object that keeps student's information and stud is the variable that will represent the student object in application.

Again non-primitive Data Structures can be divide into two different parts,

1.  Linear Primitive Data Structure


Data Structures that stores data in sequential manner caller linear data structure. Array, Stack, Queue,List are the examples of Linear DS.


2.  Non-Linear Primitive Data Structure


Data Structures that does not store data in sequential manner, it stores data randomly in memory are known as non-linear DS. Tree and Graphs are the examples of non-linear DS.


Let's understand types of data structure with diagram given below. 
Types of Data Structure
Understanding Data Structure. ByTechAchievers.com

We will learn each topic one by one in next chapters

Operations Of Data Structure

Data Structure algorithms deals with memory we need to perform many operations with 
data values.

Insertion   – Inserting data elements from specified position.

Deletion    – Deleting data from elements from specified position.

Traverse   – Reading elements from data structure.

Searching – Searching elements from data structure.

Sorting     – Sorting elements from data structure.

Merging   – Merging data elements from different data structures.


Thanks for reading, do share and comment your suggestions with us.

1 comment:

  1. n extra favorite spot loaded with fakers made to take after an assortment of knuckle-headed end clients. Also, an exceptional spot of hellfire for programmers... ExcelR Data Science Courses

    ReplyDelete

Powered by Blogger.