INTRODUCTION ABOUT DATA STSUCTURE

//DEFINATION:

=>DATA STRUCTURE:- is a collection of data elements organised in a specific manner and accessing functions are defined to store and retrieve individual data elements. 

*sometimes data structures are also called data types.

=>ANOTHER DEFINATION:-the mathematical or logical model of particular organization of data is called data structure.

=>DIFFERENT TYPES OF DATA STRUCTURES:

1) Array

2) Stack

3) Linked List

4) Graph

5) Tree

// DEFINATION:

=>DATA TYPE :- means what type of value you can store in a variable.

=>ARRAY :- is a collection of similar data type elements. eg: int[5] means all the 5 elements have int data type.

=>STACK :- is a collection of node in which insertion and deletion takes place from the top of stack.

=>LINKED LIST :- is also a collection of nodes in which each node consist of two parts

(a) INFO- it is called information part which hold the data item.

(b) LINK- is also called next pointer field which contain the address of the neighbouring node.

=>TREE :- is a collection of nodes. It consist of root node.

=>GRAPH :- is a collection of different points called nodes or vertex in which these nodes are connected to each other through lines called edges.

// DIFFERENT OPERATIONS ON DATA STRUCTURE

1) TRAVERSAL-process each and every node of list excatly once.

2) SEARCHING- means find the loc (location) of the item in the list.

3) PUSH-means insertion of item in list.

4) POP- means deletion of item from list.

5) SORT- arrange data in either accending or decending order.

So this is all about basic terminology used in data structure and further we study wide about these topics.

Kindly Share The Love »»

Tweet

Save on Delicious