TYPES DATA STRUCTURES( LINEAR AND NON LINEAR)....

IT WILL HELP YOU TO STUDY ABOUT TYPES OF DATA STRUCTURES IN BRIEF.. THANK YOU FOR SUPPORT PLZ GIVE THE FEEDBACK...

1. Presentation On TYPES OF DATA STRUCTURES Sub: DATA STRUCTURES 3 nd Sem Computer (2015-16)   Prepared By: Name: Shail M Nakum Enr No: 150410107054 Class: S.Y .: Computer Div.-I

2. Data Structure It is a logical way of storing data and it also define mechanism of retrieve data.

3. Types of Data Structure 3 8/1/2016 SHAIL M. NAKUM (150410107054)

4. 8/1/2016 SHAIL M. NAKUM (150410107054) 4 Difference between Linear and Nonlinear Data Structures

5. 8/1/2016 SHAIL M. NAKUM (150410107054) 5 Main difference between linear and nonlinear data structures lie in the way they organize data elements . In linear data structures, data elements are organized sequentially and therefore they are easy to implement in the computer’s memory. In nonlinear data structures, a data element can be attached to several other data elements to represent specific relationships that exist among them.

6. 8/1/2016 SHAIL M. NAKUM (150410107054) 6 Due to this nonlinear structure, they might be difficult to be implemented in computer’s linear memory compared to implementing linear data structures. Selecting one data structure type over the other should be done carefully by considering the relationship among the data elements that needs to be stored.

7. Linear Data Structure 1.Array 2.Stack 3.Queue 4.Linked List 7 8/1/2016 SHAIL M. NAKUM (150410107054)

8. 1.Array An array is a collection of homogeneous type of data elements. An array is consisting of a collection of elements . 8 8/1/2016 SHAIL M. NAKUM (150410107054)

9. Array Representation 9 8/1/2016 SHAIL M. NAKUM (150410107054)

10. 2.Stack A Stack is a list of elements in which an element may be inserted or deleted at one end which is known as TOP of the stack. 10 8/1/2016 SHAIL M. NAKUM (150410107054)

11. Operation Performed o f Stack Push: add an element in stack Pop: remove an element in stack 11 8/1/2016 SHAIL M. NAKUM (150410107054)

12. Stack Representation 12 8/1/2016 SHAIL M. NAKUM (150410107054)

13. 3.Queue A queue is a linear list of element in which insertion can be done at one end which is known as front and deletion can be done which is known as rear. 13 8/1/2016 SHAIL M. NAKUM (150410107054)

14. Representation of Queue 14 8/1/2016 SHAIL M. NAKUM (150410107054)

15. 4.Linked List A Linked list is a linear collection of data elements .It has two part one is info and other is link part.info part gives information and link part is address of next node 15 8/1/2016 SHAIL M. NAKUM (150410107054)

16. Linked Representation 16 8/1/2016 SHAIL M. NAKUM (150410107054)

17. 2.Non Linear 1.Tree 2.Graph 17 8/1/2016 SHAIL M. NAKUM (150410107054)

18. 1.Tree In computer science, a tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes. 18 8/1/2016 SHAIL M. NAKUM (150410107054)

19. Tree Representation 19 8/1/2016 SHAIL M. NAKUM (150410107054)

20. 2.Graph A graph data structure may also associate to each edge some edge value , such as a symbolic label or a numeric attribute (cost, capacity, length, etc.). 20 8/1/2016 SHAIL M. NAKUM (150410107054)

21. Graph Representation 21 8/1/2016 SHAIL M. NAKUM (150410107054)

22. 22 8/1/2016 SHAIL M. NAKUM (150410107054)