Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    Practical No 16 - 17 Stack OPerations

    Uploaded by

    ridashaikh215

    Copyright:

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

    Practical No 16 - 17 Stack OPerations

    Uploaded by

    ridashaikh215
    6 views7 pages

    Original Title

    Practical No 16_17 Stack OPerations

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    6 views7 pages

    Practical No 16 - 17 Stack OPerations

    Uploaded by

    ridashaikh215

    Copyright:

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

    // Practical No. 16 WAP TO implement stack operations using array.

    #include <stdio.h>

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

    void push();

    void pop();

    void show();

    int main ()

    printf("Enter the number of elements in the stack ");

    scanf("%d",&n);

    printf("*********Stack operations using array*********");

    printf("\n----------------------------------------------\n");

    while(choice != 4)

    printf("Chose one from the below options...\n");

    printf("\n1.Push\n2.Pop\n3.Show\n4.Exit");

    printf("\n Enter your choice \n");

    scanf("%d",&choice);

    switch(choice)

    case 1:

    push();

    break;
    }

    case 2:

    pop();

    break;

    case 3:

    show();

    break;

    case 4:

    printf("Exiting....");

    break;

    default:

    printf("Please Enter valid choice ");

    };

    void push ()
    {

    int val;

    if (top == n )

    printf("\n Overflow");

    else

    printf("Enter the value?");

    scanf("%d",&val);

    top = top +1;

    stack[top] = val;

    void pop ()

    if(top == -1)

    printf("Underflow");

    else

    top = top -1;

    void show()

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

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

    }
    if(top == -1)

    printf("Stack is empty");

    OUTPUT:-

    Enter the number of elements in the stack 5

    *********Stack operations using array*********

    ----------------------------------------------

    Chose one from the below options...

    1.Push

    2.Pop

    3.Show

    4.Exit

    Enter your choice

    Stack is emptyChose one from the below options...

    1.Push

    2.Pop

    3.Show

    4.Exit

    Enter your choice


    1

    Enter the value?88

    Chose one from the below options...

    1.Push

    2.Pop

    3.Show

    4.Exit

    Enter your choice

    Enter the value?90

    Chose one from the below options...

    1.Push

    2.Pop

    3.Show

    4.Exit

    Enter your choice

    90

    88

    Chose one from the below options...

    1.Push
    2.Pop

    3.Show

    4.Exit

    Enter your choice

    Chose one from the below options...

    1.Push

    2.Pop

    3.Show

    4.Exit

    Enter your choice

    88

    Chose one from the below options...

    1.Push

    2.Pop

    3.Show

    4.Exit

    Enter your choice

    Exiting....

    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