Upcoming SlideShare
Loading in …5
×

# Data structure and its types

21,464 views

Published on

Published in: Education
3 Comments
14 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
Your message goes here
• very nice

Are you sure you want to  Yes  No
Your message goes here
• its nice ..

Are you sure you want to  Yes  No
Your message goes here
• its niceeeeeeee

Are you sure you want to  Yes  No
Your message goes here
No Downloads
Views
Total views
21,464
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
946
Comments
3
Likes
14
Embeds 0
No embeds

No notes for slide

### Data structure and its types

1. 1. MOST WEL COME<br />
2. 2. Presentation on Data Structure<br />Submitted To Submitted By<br />Mrs. Jaspreet Kaur Navtar Singh<br />(Lect.) Roll no:-2219<br /> BCA-1ST(E)<br /> Group:-A<br />BABA FARID COLLEGE OF COMPUTER SCIENCE AND IT<br /> (BATHINDA)<br />
3. 3. Data Structure<br /> And its types<br />
4. 4. Data structure <br />It is a logical way to storing the data and it also define mechanism of retrieve data.<br />
5. 5. Types of Data Structure<br />
6. 6. 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 />
7. 7. Linear Data Structure<br />1.Array<br />2.Stack<br />3.Queue<br />4.Linked List<br />
8. 8. Array<br />:-An array is a collection of homogeneous type of data elements.<br />:-An array is consisting of a collection of elements .<br />
9. 9. Operation Performed On Array<br />1.Traversing<br />2.Search<br />3.Insertion<br />4.Deletion<br />5.Sorting<br />6.Merging<br />
10. 10. Representation of Array<br />
11. 11. Array Representation<br />
12. 12. 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 />
13. 13.
14. 14. Representation of Stack<br />3/20/2011<br />14<br />
15. 15. Stack Representation<br />3/20/2011<br />15<br />
16. 16. 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 />3/20/2011<br />16<br />
17. 17. Operation Performed On Queue<br />Insertion : Add A New Element In Queue<br />Deletion: Removing An Element In Queue<br />3/20/2011<br />17<br />
18. 18. Representation of Queue<br />3/20/2011<br />18<br />
19. 19. Queue Representation<br />3/20/2011<br />19<br />
20. 20. 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 />3/20/2011<br />20<br />
21. 21. Operation Performed on Linked List<br />1.Traversing<br />2.Searching<br />3.Insertion<br />4.Deletion<br />3/20/2011<br />21<br />
22. 22. Linked Representation<br />3/20/2011<br />22<br />
23. 23. 2.Non Linear<br />1.Tree<br />2.Graph<br />3/20/2011<br />23<br />
24. 24. Tree<br />In computer science, a tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes.<br />3/20/2011<br />24<br />
25. 25. Operation On Tree<br />1.Insertion<br />2.Deletion<br />3.Searching<br />3/20/2011<br />25<br />
26. 26. Tree Representation<br />3/20/2011<br />26<br />
27. 27. 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 />3/20/2011<br />27<br />
28. 28. Operation Performed Graph<br />1.Searching<br />2.Insertion<br />3.Deletion<br />3/20/2011<br />28<br />
29. 29. Graph Representation<br />3/20/2011<br />29<br />
30. 30. BABA FARID GROUP OF INSTITUTIONS (BATHINDA)<br />3/20/2011<br />30<br />
31. 31. THANKS FOR YOUR VISIT<br /> NAVTAR SIDHU<br /> ROLL NO:2219<br /> BCA=1ST (E)SEM 2ND<br /> BABA FARID GROUP OF INSTITUTIONS<br /> BATHINDA<br />3/20/2011<br />31<br />