introduction to data structure and algorithms.pptx
- 3. Data Structure It is a logical way of storing data and it also define mechanism of retrieve data.
- 4. Types of Data Structure DATA STRUCTUR E NON LINEAR LINEAR
- 5. 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 structure Deletion : removing a record from the structure
- 7. 1.Array An array is a collection of homogeneous type of data elements. An array is consisting of a collection of elements .
- 9. Representation of array in memory 1 2 3 4 5
- 11. 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.
- 12. Operation Performed on Stack Push: add an element in stack Pop: remove an element in stack
- 13. Representation of Stack EEE TOP DDD CCC BBB AAA
- 15. 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.
- 16. Operation Performed On Queue Insertion : add a new element in queue Deletion: Removing an element in queue
- 17. Representation of Queue 55 65 75
- 19. 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
- 20. Operation Performed on Linked List 1.Traversing 2.Searching 3.Insertion 4.Deletion
- 23. 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.
- 26. 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.).