Operating Systems: Data Structures
Download as PPTX, PDF3 likes3,220 views
The document discusses different data structures: a queue, which follows FIFO (first in, first out) where the first item joined is the first served; a stack, which follows LIFO (last in, first out) where the last item joined is the first served; and a heap, which is a tree structure where lower values are near the bottom and higher values towards the top.
Operating Systems: Data Structures
- 2. What is a queue?
- 3. What is a queue?
- 4. What is a queue? 5 31 47 81 71 10
- 5. What is a queue? 5 31 47 81 71 10
- 6. What is a queue? It’s a structure that conforms to the principle of First In, First Out (FIFO). The first item to join the queue is the first item to be served.
- 7. What is a stack?
- 8. What is a stack? 5 31 47 81 71 10
- 9. What is a stack? 5 31 47 81 71 10
- 10. What is a stack? It’s a structure that conforms to the principle of Last In, First Out (LIFO). The last item to join the stack is the first item to be served.
- 11. What is a heap?
- 12. What is a heap?
- 13. What is a heap? 31 5 47 10 71 81 1
- 14. What is a heap? 31 5 47 10 71 81 1
- 15. What is a heap? A heap is a tree-like structure generally each node has two children nodes, where the lower values are stored near the bottom of the tree and higher values towards the top of the tree.
- 16. What is a heap? MORE FORMALLY: The heap property: ◦ If A is a parent node of B then the key of node A is ordered with respect to the key of node B with the same ordering applying across the heap
- 17. What is a queue? 9 10 11 12 13 14 15 16 18 19 1 2 3 4 5 6 7 8 0 17 20
- 18. What is a queue? 9 10 11 12 13 14 15 16 18 19 1 2 3 4 5 6 7 8 0 17 20
- 19. What is a stack? 9 10 11 12 13 14 15 16 18 19 1 2 3 4 5 6 7 8 0 17 20
- 20. What is a stack? 9 10 11 12 13 14 15 16 18 19 1 2 3 4 5 6 7 8 0 17 20
- 21. What is a heap? 9 10 11 12 13 14 15 16 18 19 1 2 3 4 5 6 7 8 0 17 20
- 22. What is a heap? 9 10 11 12 13 14 15 16 18 19 1 2 3 4 5 6 7 8 0 17 20 Based on value not location