STACK USING ARRAY by smd

-


STACK USING ARRAY


#include <stdio.h>

int stack[100],top=-1,n,i,choice = 0;

void push();

void pop();

void peek();

void display();

void main()

{

printf("Enter no of elements which you want to insert\n");

scanf("%d",&n);

while (choice!=5)

{

printf(" Choose the option below \n");

printf("1.push\n2.pop\n3.peek\n4.display\n5.exit\n");

scanf("%d",&choice);

switch(choice)

{

case 1:

push();

break;

case 2:

pop();

break;

case 3:

peek();

break;

case 4:

display();

break;

case 5:

printf("Exiting.....\n");

break;

default:

printf("invalid entry\n");

break;

}

}

}

void push()

{

    if(top>=n-1)

    {

        printf("stack is overflow \n");

    }

    else

    {

     int x;

     printf("enter the x value\n");

     scanf("%d",&x);

     top++;

     stack[top]=x;

    }

}

void pop()

{

    if(top ==-1)

    {

        printf("stack is underflow \n");

    }

    else

    {

       printf("%d is deleted \n",stack[top]);

    top--;

    }

}

void peek()

{

    if(top==-1)

    {

        printf("stack is empty\n");

    }

    else

    {

        printf("%d is topmost element\n",stack[top]);

    }

}

void display()

{

    if(top==-1)

    {

        printf("stack is empty\n");

    }

    else

    {

         printf ("stack elements are\n");

         for(i=top;i>=0;i--)

         {

             printf("%d\n",stack[i]);

         }

    }

}














output:

Enter no of elements which you want to insert

5

 Choose the option below 

1.push

2.pop

3.peek

4.display

5.exit

1

enter the x value

10

 Choose the option below 

1.push

2.pop

3.peek

4.display

5.exit

1

enter the x value

20

 Choose the option below 

1.push

2.pop

3.peek

4.display

5.exit

1  

enter the x value

30

 Choose the option below 

1.push

2.pop

3.peek

4.display

5.exit

1

enter the x value

40

 Choose the option below 

1.push

2.pop

3.peek

4.display

5.exit

1

enter the x value

50

 Choose the option below 

1.push

2.pop

3.peek

4.display

5.exit

4

stack elements are

50

40

30

20

10

 Choose the option below

1.push

2.pop

3.peek

4.display

5.exit

2

50 is deleted 

 Choose the option below

1.push

2.pop

3.peek

4.display

5.exit

2

40 is deleted 

 Choose the option below

1.push

2.pop

3.peek

4.display

5.exit

3

30 is topmost element

 Choose the option below

1.push

2.pop

3.peek

4.display

5.exit

4

stack elements are

30

20

10

 Choose the option below

1.push

2.pop

3.peek

4.display

5.exit

5

Exiting.....

Comments

Post a Comment

Popular posts from this blog

SINGLE LINKED LIST by smd

-
#include <stdio.h> #include <stdlib.h> int count = 0; struct node {       int data;       struct node *next; }  *head = NULL, *newnode, *trav; void create_list() {       int value;       struct node *temp;       newnode = (struct node *)malloc(sizeof(struct node));       printf("Enter the value to be inserted: ");       scanf("%d", &value);       newnode->data = value;       newnode->next = NULL;       if (head == NULL) {           head = newnode;       } else {           temp = head;           while (temp->next != NULL)               temp = temp->next;           temp->next = newnode;       }       count++; } void insert_at_beg...
Read more

CLL by smd

-
PROGRAM #include <stdio.h> #include <stdlib.h> int count = 0; struct node {  int data; struct node *next; }; struct node *head = NULL, *newnode, *temp; void create_circle_linked_list(); void insert_at_begin(); void insert_at_end(); void insert_at_specific_point(); void delete_at_begin(); void delete_at_end(); void delete_at_specific_point(); void display(); void create_circle_linked_list()  {  int value; printf("Enter the value to be inserted: "); scanf("%d", &value); newnode = (struct node*)malloc(sizeof(struct node)); newnode->data = value; if (head == NULL)  {  head = newnode;  newnode->next = head;  } else  {  temp = head;  while (temp->next != head) temp = temp->next; temp->next = newnode; newnode->next = head;     }     count++; } void insert_at_begin()  { int value;  printf("Enter the value to be inserted: "); scanf("%d", &value); newnode = (struct node*)malloc(si...
Read more

QUEUE USING ARRAYS by smd

-
 #include<stdio.h> #define size 100 int queue[size]; int front = -1, rear = -1; void enqueue(int x)  {     if (rear == size - 1)      {         printf("Queue is overflow\n");     } else      {         if (front == -1)          {             front = 0; // Initialize front if queue was empty         }         rear++;         queue[rear] = x;         printf("%d inserted sucessfully\n", x);     } } void dequeue()  {     if (front == -1 || front > rear)      {         printf("Queue is underflow\n");     } else      {         printf("%d deleted successfully\n", queue[front]);         front++;         if (front ...
Read more