Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Stack Program

    Uploaded by

    anubhavseth56

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd

    Stack Program

    Uploaded by

    anubhavseth56
    13 views3 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    13 views3 pages

    Stack Program

    Uploaded by

    anubhavseth56

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    You are on page 1of 3

    #include<stdio.

    h>

    #include<stdlib.h>

    #define Size 4

    int Top=-1, stack_array[Size];


    void Push();
    void Pop();
    void show();

    int main()
    {
    int choice;

    while(1)
    {
    printf("\nOperations performed by Stack");
    printf("\n1.Push the element\n2.Pop the element\n3.Show\n4.End");
    printf("\n\nEnter the choice:");
    scanf("%d",&choice);

    switch(choice)
    {
    case 1: Push();
    break;
    case 2: Pop();
    break;
    case 3: show();
    break;
    case 4: exit(0);

    default: printf("\nInvalid choice!!");


    }
    }
    }

    void Push()
    {
    int x;

    if(Top==Size-1)
    {
    printf("\nOverflow!!");
    }
    else
    {
    printf("\nEnter element to be inserted to the stack:");
    scanf("%d",&x);
    Top=Top+1;
    stack_array[Top]=x;
    }
    }

    void Pop()
    {
    if(Top==-1)
    {
    printf("\nUnderflow!!");
    }
    else
    {
    printf("\nPopped element: %d",stack_array[Top]);
    Top=Top-1;
    }
    }

    void show()
    {

    if(Top==-1)
    {
    printf("\nUnderflow!!");
    }
    else
    {
    printf("\nElements present in the stack: \n");
    for(int i=Top;i>=0;--i)
    printf("%d\n",stack_array[i]);
    }
    }

    Operations performed by Stack


    1.Push the element
    2.Pop the element
    3.Show
    4.End

    Enter the choice:1

    Enter element to be inserted to the stack:10

    Operations performed by Stack


    1.Push the element
    2.Pop the element
    3.Show
    4.End

    Enter the choice:3

    Elements present in the stack:


    10

    Operations performed by Stack


    1.Push the element
    2.Pop the element
    3.Show
    4.End

    Enter the choice:2


    Popped element: 10

    Operations performed by Stack


    1.Push the element
    2.Pop the element
    3.Show
    4.End

    Enter the choice:3


    Underflow!!

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy