Data structure and its types

120,104 views

Published on

Published in: Education, Technology
10 Comments
107 Likes
Statistics
Notes
No Downloads
Views
Total views
120,104
On SlideShare
0
From Embeds
0
Number of Embeds
13
Actions
Shares
0
Downloads
3,903
Comments
10
Likes
107
Embeds 0
No embeds

No notes for slide

Data structure and its types

  1. 1. Wel Come<br /> TO YOU<br />
  2. 2. DATA STRUCTURE<br /> AND ITS TYPES<br />
  3. 3. DataStructure<br />It is a logical way of storing data and it also define mechanism of retrieve data.<br />
  4. 4. Types of Data Structure<br />
  5. 5. Data Structure Operation <br />Traversing: Accessing each record exactly once so that certain item in the record may be processed.<br />Searching: finding the location of the record with a given key value .<br />Insertion : add a new record to the structure<br />Deletion : removing a record from the structure<br />
  6. 6. Linear Data Structure<br />1.Array<br />2.Stack<br />3.Queue<br />4.Linked List<br />
  7. 7. 1.Array<br />An array is a collection of homogeneous type of data elements.<br />An array is consisting of a collection of elements .<br />
  8. 8. Operation Performed On Array<br />1.Traversing<br />2.Search<br />3.Insertion<br />4.Deletion<br />5.Sorting<br />6.Merging<br />
  9. 9. Representation of array in memory<br />
  10. 10. Array Representation<br />
  11. 11. 2.Stack<br />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.<br />
  12. 12. Operation Performed on Stack<br /> Push: add an element in stack<br /> Pop: remove an element in stack <br />
  13. 13. Representation of Stack<br />
  14. 14. Stack Representation<br />
  15. 15. 3.Queue<br />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.<br />
  16. 16. Operation Performed On Queue<br />Insertion : add a new element in queue<br />Deletion: Removing an element in queue<br />
  17. 17. Representation of Queue<br />
  18. 18. Queue Representation<br />
  19. 19. 4.Linked List<br />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<br />
  20. 20. Operation Performed on Linked List<br />1.Traversing<br />2.Searching<br />3.Insertion<br />4.Deletion<br />
  21. 21. Linked Representation<br />
  22. 22. 2.Non Linear<br />1.Tree<br />2.Graph<br />
  23. 23. 1.Tree<br />In computer science, a tree is a widely-used data structurethat emulates a hierarchical tree structure with a set of linked nodes.<br />
  24. 24. Operation On Tree<br />1.Insertion<br />2.Deletion<br />3.Searching<br />
  25. 25. Tree Representation<br />
  26. 26. 2.Graph<br />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.).<br />
  27. 27. Operation Performed Graph<br />1.Searching<br />2.Insertion<br />3.Deletion<br />
  28. 28. Graph Representation<br />
  29. 29. BABA FARID COLLEGE (BATHINDA)<br />
  30. 30. THANKS FOR YOUR VISIT<br /> NAVTAR SIDHU<br /> ROLL NO:2219<br /> BCA=1ST (E)SEM 2ND<br />

×