![What is Stack ?
• Stack is used as Linear data structure which can be
accessed from only one end .
• Stack is LIFO Structure [ Last in First Out ]
• Stack is Ordered List of Elements of Same Type.
• Stack is Linear List
• In Stack Operations such as Insertion of an element
is called PUSH and Deletion of an element is called
POP. Both operations permitted at only one end
called Top](https://image.slidesharecdn.com/stack-240710063349-422156f4/85/stack-opeartions-on-stack-applications-of-stack-3-320.jpg)
More Related Content
Similar to stack, opeartions on stack, applications of stack (20)
stack, opeartions on stack, applications of stack
- 1. STACK
- 2. STACK • Common Example : • Suppose at your home you have multiple chairs then you put them together to form a vertical pile. From that vertical pile the chair which is placed last is always removed first. Chair which was placed first is removed last. In this way we can see how stack is related to us.
- 3. What is Stack ? • Stack is used as Linear data structure which can be accessed from only one end . • Stack is LIFO Structure [ Last in First Out ] • Stack is Ordered List of Elements of Same Type. • Stack is Linear List • In Stack Operations such as Insertion of an element is called PUSH and Deletion of an element is called POP. Both operations permitted at only one end called Top
- 4. Representation of Stack in Memory Representation of Stack in Memory The stack • The stack can be implemented into two ways: ◦ Using arrays (Static implementation) ◦ Using pointer (Dynamic implementation) implementation)Representation of Stack in Memory The stack can be implemented into two ways: ◦ Using arrays (Static implementation) ◦ Using pointer (Dynamic implementation)
- 5. Visual Representation of Stack : • View 1 : When Stack is Empty When Stack is said to empty then it does not contain any element inside it. Whenever the Stack is Empty the position of topmost element is -1.
- 6. • View 2 : When Stack is Not Empty • Whenever we add very first element then topmost position will be incremented by 1. After adding First Element top = 0.
- 7. • View 3 : • After Deletion of 1 Element Top Will be Decremented by 1
- 8. Operations on Stack Representation of Stack in Memory The stack • PUSH: It adds a new element to the top of the stack. After every push operation top of stack incremented by one. If stack is full no new element can be accommodated, this condition is called stack overflow or stack is full.
- 9. Operations on Stack Representation of Stack in Memory The stack • POP: I It removes the top element from the stack.): After every pop operation top of stack decremented by one. If stack is empty and pop operation performed this will result into stack underflow condition or stack empty. he stack
- 10. Array Representation of Stack in C Programming : • 1-D array is used to hold the element of the stack. • Variable “top” keeps track of “Topmost” Element in the stack. • “MAXSIZE” is used as Constant which gives maximum size of Stack.
- 12. PUSH operation on stack
- 13. POP operation on stack
- 14. APPLICATION OF THE STACK 1. Mathematical Expression Evaluation 2. Expression conversion a.Infix to Postfix. b.Infix to Prefix. c.Postfix to Infix. d.Prefix to Infix. 3.Parsing 4.Simulation of recursion 5.Function call and recursion 5. Stack frame 6. Reversing a String