Applications of Data-Structure

Presentation On

What is Data Structure?Array & its applicationsStack & its applicationsQueue & its applicationsLinked List & its applicationsTree & its applicationsGraph & its applicationsConclusion

Data structure is representation of the logical relationship existing between individual elements of data .

Data Structure is the logical or mathematical model of a particular organization of data is called the Data Structure

Arrays Arrays

To store elements of the same data type. Used for maintaining multiple variable names using single name. Used for Sorting Elements Used in CPU Scheduling [Queue] Can be Used in Recursive Function

Stacks : Last in First out Queue:First in First out

StacksStacks

Direct ApplicationsPage-visited history in a Web browserUndo sequence in a text editorSaving local variables when one function calls another, and this one calls another, and so on.

Indirect ApplicationsAuxiliary data structure for algorithmsComponent of other data structures

A Queue is an ordered collection of items from which items may bedeleted at one end (called the front of the queue) and into which items may be inserted at the other end (the rear of the queue).

Direct Applications Waiting lines

Access to shared resources (e.g., printer)Multiprogramming

Indirect ApplicationsAuxiliary data structure for algorithmsComponent of other data structures

A Linked List is a data structure which can change during execution.

Successive elements are connected by pointers.Last element points to NULL.

For representing PolynomialsIt means in addition/subtraction/multiplication.. of two polynomials.

Eg: We have p1=2x^2+3x+7 and p2=3x^3+5x+2 then p1+p2=3x^3+2x^2+8x+9 In Dynamic Memory ManagementIn allocation and releasing memory at runtime

TreeNodesEach node can have 0ne or more childrenA node can have at most one parentBinary tree Tree with 0–2 children per node

DBMS(Data Base Management) Operating System Network Topology (LAN,MAN & WAN.)

A graph G = (V,E) is composed of:V: set of verticesE: set of edges connecting the vertices in V

An edge e = (u,v) is a pair of verticesExample:

a b

c

d e

V= {a,b,c,d,e}

E= {(a,b),(a,c),(a,d),(b,e),(c,d),(c,e),(d,e)}

Electronic circuitsNetworks (roads, flights, communications)

CS16

LAX

JFK

LAX

DFW

STLHNL

Electronic circuitsNetworks (roads, flights, communications)Network Topology

DBMS(Data Base Management)Operating System

Waiting lines Page-visited history in a

Web browser Undo sequence in a text

edition

THANKS

19