![Declaration as Array
Kamus:
Const
MaxStack = value {value is integer number}
Type
NamaStack = array [1..MaxStack] of tipedata
Stack : NamaStack
Top : integer {pointer of stack}](https://image.slidesharecdn.com/chapter8-stack-161018120225-230815165749-f9d9212f/85/chapter8-stack-161018120225-pdf-6-320.jpg)
chapter8-stack-161018120225.pdf
- 3. Stack Stack is data structure whose its elemen can be added and taken only from last position (top).
- 4. Components of Stack • Top is a variable which refers to last position in stack. • Element is component which has data. • MaxStack is variable that describes maximum number of elements in a stack.
- 6. Declaration as Array Kamus: Const MaxStack = value {value is integer number} Type NamaStack = array [1..MaxStack] of tipedata Stack : NamaStack Top : integer {pointer of stack}
- 7. Declaration as List Kamus: Type NamaPointer = ↑Stack Stack = Record < MedanData : TipeData, MedanSambungan : NamaPointer > EndRecord Top : NamaPointer {pointer of stack}
- 9. Operation • Initialization • Empty Operation • Full Operation (array)/One Node Operation (Linked List) • Push • Pop
- 10. Main Operation PUSH STACK Take data from element in stack POP Add data to element in stack.
- 11. Kinds of Operation • Stack Operation in array form • Stack Operation in Linked list form
- 12. STACK OPERATION IN ARRAY FORM
- 13. Operation that give a initial value for top pointer in stack with the following rules: • Give 0 if the first element starts from 1 • Give -1 if the first element starts from 0 Initialization
- 14. Operation that returns true if the top pointer have 0 or -1 as its value (depend on initialization) or returns false to the contrary. Empty Operation
- 15. Operation that returns true if top have reached maximum array or maximum array -1 (depend on initialization) or returns false if top is not equal to maximum array. Full Operation
- 16. Steps in push operation: • Stack can be added when it’s not full • Add the top pointer with 1 • Stack element, which was refered by top pointer, is filled with new data. Push
- 18. Steps in pop operation: • Stack can be pop when its elements is not empty. • Element that have taken out from stack is saved in a variable. • Substract the top pointer with 1. Pop
- 20. STACK OPERATION IN LINKED LIST FORM
- 21. Prepare stack by giving null value to the top pointer in stack. Initialization
- 22. Operation that returns true if the top pointer isn’t null or returns false to the contrary. Empty Operation
- 23. Operation that returns true if right connection field has null value (stack only has one node) or returns false to the contrary. One Node Operation
- 24. Steps of push operation in linked list form is similar with front insertion. Push
- 25. Push Push(Top,8) baru 8 Top Push(Top,3) baru 3 8 Top
- 26. Push Push(Top,5) baru 3 8 Top 5
- 27. Steps of pop operation in linked list form is similar with front deletion. Pop
- 31. Do the task 6.27 until 6.29 in page 210 at Data Structures book, seymour. Exercise
- 32. Contact Person: Adam Mukharil Bachtiar Informatics Engineering UNIKOM Jalan Dipati Ukur Nomor. 112-114 Bandung 40132 Email: adfbipotter@gmail.com Blog: http://adfbipotter.wordpress.com Copyright © Adam Mukharil Bachtiar 2012