Data structure Stack presentation for university student .this presentation created by "Sheikh-Monirul-Hasan " in Department of computer science at Green University of Bangladesh.

1. Submitted By:
Sheikh Monirul
Hasan
ID: 162015077
Department: CSE
Submitted To:
Lecturer : Department of CSE
Green University of Bangladesh
Green University of Bangladesh
1

2. Welcome
to
Our Presentation
2

3. Stack
3

4. 1.What is Stack
Stack Operation
1.A LIFO Satack
4.Push Operation
5.Pop Operation
6.Stack Program
.Program Output
4

5. A stack is a Last In, First Out (LIFO) data structure,objects
inserted last are the first to come out of the stack
Anything added to the stack goes on the “top” of the stack
Anything removed from the stack is taken from the “top” of the
stack
Things are removed in the reverse order from that in which they
were inserted
5

6. PUSH
Adds the object to the top of the stack
POP
Removes the object at the top of the stack and returns it
PEEK
Returns the top object of the stack but does not remove it from the
stack
ISEMPTY
Returns True if Stack is empty
6

7. Top
Bottom
Stack Pointer
Push Pop
7

8. 8

9. 9

10. #include <stdio.h>
#define MAXSIZE 5
struct stack
{
int stk[MAXSIZE];
int top;
};
typedef struct stack STACK;
STACK s;
void push(void);
int pop(void);
void display(void);
void main ()
{
int choice;
int option = 1;
s.top = -1;
printf ("STACK OPERATIONn");
while (option)
{
printf ("------------------------------------------n");
printf (" 1 --> PUSH n");
printf (" 2 --> POP n");
printf (" 3 --> DISPLAY n");
printf (" 4 --> EXIT n");
printf ("------------------------------------------n");
printf ("Enter your choicen");
scanf ("%d", &choice);
switch (choice)
10

11. {
case 1:
push();
break;
case 2:
pop();
break;
case 3:
display();
break;
case 4:
return;
}
fflush (stdin);
printf ("Do you want to continue(Type 0 or 1)?n");
scanf ("%d", &option);
}
}
/* Function to add an element to the stack */
void push ()
{
int num;
if (s.top == (MAXSIZE - 1))
{
printf ("Stack is Fulln");
return;
}
else
{
printf ("Enter the element to be pushedn");
scanf ("%d", &num);
s.top = s.top + 1;
s.stk[s.top] = num;
}
return;
} 11

12. int pop ()
{
int num;
if (s.top == - 1)
{
printf ("Stack is Emptyn");
return (s.top);
}
else
{
num = s.stk[s.top];
printf ("poped element is = %dn", s.stk[s.top]);
s.top = s.top - 1;
}
return(num);
}
/* Function to display the status of the stack */
void display ()
{
int i;
if (s.top == -1)
{
printf ("Stack is emptyn");
return;
}
else
{
printf ("n The status of the stack is n");
for (i = s.top; i >= 0; i--)
{
printf ("%dn", s.stk[i]);
}
}
printf ("n");
return 0;
} 12

13. 13

14. 14

15. 15
Have you any Question ?

16. 16
Thank You