Applications of Data-Structure Presentation On Applications of Data-Structure

Contents What is Data Structure? Array & its applications Stack & its applications Queue & its applications Linked List & its applications Tree & its applications Graph & its applications Conclusion

Data Structure 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 An Array is a group of similar data items which are referred by a common name. Simply ,Array may be defined abstractly as finite order set of homogeneous elements.

Applications of Array 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 Stacks & Queues Stacks : Last in First out Queue:First in First out

Stacks A Stack is a list in which all insertions and deletions are made at one end, called the TOP. The last element to be inserted into the stack will be the first to be removed.

Applications of Stacks Direct Applications Page-visited history in a Web browser Undo sequence in a text editor Saving local variables when one function calls another, and this one calls another, and so on. Indirect Applications Auxiliary data structure for algorithms Component of other data structures

Queues A Queue is an ordered collection of items from which items may be deleted 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).

Applications of Queues Direct Applications Waiting lines Access to shared resources (e.g., printer) Multiprogramming Indirect Applications Auxiliary data structure for algorithms Component of other data structures

Linked List A Linked List is a data structure which can change during execution. Successive elements are connected by pointers. Last element points to NULL.

Applications of Linked List For representing Polynomials It 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 Management In allocation and releasing memory at runtime

Trees Tree Nodes Each node can have 0ne or more children A node can have at most one parent Binary tree Tree with 0–2 children per node

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

Graph a b c d e A graph G = (V,E) is composed of: V: set of vertices E: set of edges connecting the vertices in V An edge e = (u,v) is a pair of vertices Example: a b V= {a,b,c,d,e} E= {(a,b),(a,c),(a,d), (b,e),(c,d),(c,e), (d,e)} c d e

Applications of Graph Electronic circuits Networks CS16 Electronic circuits Networks (roads, flights, communications) LAX JFK DFW STL HNL

CONCLUSION Waiting lines Page-visited history in a Web browser Undo sequence in a text edition CONCLUSION Electronic circuits Networks (roads, flights, communications) Network Topology DBMS(Data Base Management) Operating System

THANKS

QUERY ????