12. Stack

Stack
By
Nilesh Dalvi
Lecturer, Patkar-Varde College.Lecturer, Patkar-Varde College.
http://www.slideshare.net/nileshdalvi01
Java and DataJava and Data
StructuresStructures

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.
• Operation Performed On Array:
1. Push: add an element in stack
2. Pop: remove an element in stack
3. Peek :Current processed element
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).
a
b
c TOP

Array representation of stacks:
• We can represent a stack in computer in various ways, by
means of one-way-list or linear array.
• Consider Linear array stack:
• TOP : Location of the top element of the stack
• MAXSTK : max elements that can be held by stack
• If TOP = 0 or TOP = NULL indicates that stack is empty.
XX YY ZZ
1 2 3 4 5 6 7 8
TOP MAXSTK

Adding element: PUSH()
Algorithm PUSH (STACK, ITEM)
{
if (TOP = MAXSTK) then
write ("Overflow");
else
TOP := TOP + 1;
STACK [TOP] := ITEM;
}

Deleting element: POP()
Algorithm POP (STACK, ITEM)
{
if (TOP = 0) then
write ("Underflow");
else
ITEM = STACK [TOP];
TOP := TOP - 1;
}

Accessing element: PEEK()
Algorithm PEEK (STACK)
{
if (TOP = 0) then
write ("Underflow");
else
Return STACK [TOP];
}

Implementation of Stack operations

Applications of Stack:
• Recursion
• Infix to postfix conversion
• Postfix to infix conversion

infixVect
postfixVect
( a + b - c ) * d – ( e + f )
Infix to postfix conversion

infixVect
postfixVect
a + b - c ) * d – ( e + f )
(

infixVect
postfixVect
+ b - c ) * d – ( e + f )
(
a

infixVect
postfixVect
b - c ) * d – ( e + f )
(
a
+

infixVect
postfixVect
- c ) * d – ( e + f )
(
a b
+

infixVect
postfixVect
c ) * d – ( e + f )
(
a b +
-

infixVect
postfixVect
) * d – ( e + f )
(
a b + c
-

infixVect
postfixVect
* d – ( e + f )
a b + c -

infixVect
postfixVect
d – ( e + f )
a b + c -
*

infixVect
postfixVect
– ( e + f )
a b + c - d
*

infixVect
postfixVect
( e + f )
a b + c – d *
-

infixVect
postfixVect
e + f )
a b + c – d *
-
(

infixVect
postfixVect
+ f )
a b + c – d * e
-
(

infixVect
postfixVect
f )
a b + c – d * e
-
(
+

infixVect
postfixVect
)
a b + c – d * e f
-
(
+

infixVect
postfixVect
a b + c – d * e f +
-

infixVect
postfixVect
a b + c – d * e f + -

Algorithm for Infix to Postfix
1) Examine the next element in the input.
2) If it is operand, output it.
3) If it is opening parenthesis, push it on stack.
4) If it is an operator, then
i) If stack is empty, push operator on stack.
ii) If the top of stack is opening parenthesis, push operator on stack
iii) If it has higher priority than the top of stack, push operator on stack.
iv) Else pop the operator from the stack and output it, repeat step 4
5) If it is a closing parenthesis, pop operators from stack and output them
until an opening parenthesis is encountered. pop and discard the opening
parenthesis.
6) If there is more input go to step 1
7) If there is no more input, pop the remaining operators to output.

12. Stack

Empfohlen

Empfohlen

Weitere ähnliche Inhalte

Andere mochten auch

Andere mochten auch (19)

Ähnlich wie 12. Stack

Ähnlich wie 12. Stack (9)

Mehr von Nilesh Dalvi

Mehr von Nilesh Dalvi (10)

Kürzlich hochgeladen

Kürzlich hochgeladen (20)

12. Stack