This document presents information on data structures and their types. It discusses linear data structures like arrays, stacks, queues and linked lists. It describes their representation and common operations like traversing, searching, insertion and deletion. The document also covers non-linear data structures like trees and graphs, describing their representation and operations like searching, insertion and deletion. It was submitted by Navtar Singh to Mrs. Jaspreet Kaur as a presentation on data structures.

1. MOST WEL COME

2. Presentation on Data StructureSubmitted To Submitted ByMrs. Jaspreet Kaur Navtar Singh(Lect.) Roll no:-2219 BCA-1ST(E) Group:-ABABA FARID COLLEGE OF COMPUTER SCIENCE AND IT (BATHINDA)

3. Data Structure And its types

4. Data structure It is a logical way to storing the data and it also define mechanism of retrieve data.

5. Types of Data Structure

6. Data Structure Operation Traversing: Accessing each record exactly once so that certain item in the record may be processed.Searching:finding the location of the record with a given key value .Insertion : add a new record to the structureDeletion : removing a record from the structure

7. Linear Data Structure1.Array2.Stack3.Queue4.Linked List

8. Array:-An array is a collection of homogeneous type of data elements.:-An array is consisting of a collection of elements .

9. Operation Performed On Array1.Traversing2.Search3.Insertion4.Deletion5.Sorting6.Merging

10. Representation of Array

11. Array Representation

12. StackA 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.

14. Representation of Stack3/20/201114

15. Stack Representation3/20/201115

16. QueueA 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.3/20/201116

17. Operation Performed On QueueInsertion : Add A New Element In QueueDeletion: Removing An Element In Queue3/20/201117

18. Representation of Queue3/20/201118

19. Queue Representation3/20/201119

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 node3/20/201120

21. Operation Performed on Linked List1.Traversing2.Searching3.Insertion4.Deletion3/20/201121

22. Linked Representation3/20/201122

23. 2.Non Linear1.Tree2.Graph3/20/201123

24. TreeIn computer science, a tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes.3/20/201124

25. Operation On Tree1.Insertion2.Deletion3.Searching3/20/201125

26. Tree Representation3/20/201126

27. GraphA 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.).3/20/201127

28. Operation Performed Graph1.Searching2.Insertion3.Deletion3/20/201128

29. Graph Representation3/20/201129

30. BABA FARID GROUP OF INSTITUTIONS (BATHINDA)3/20/201130

31. THANKS FOR YOUR VISIT NAVTAR SIDHU ROLL NO:2219 BCA=1ST (E)SEM 2ND BABA FARID GROUP OF INSTITUTIONS BATHINDA3/20/201131