Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    A69 DS Ass1

    Uploaded by

    Shruti Punekar
    Data structures assignment

    Copyright:

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

    A69 DS Ass1

    Uploaded by

    Shruti Punekar
    6 views5 pages
    Data structures assignment

    Original Title

    A69_DS_Ass1

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Data structures assignment

    Copyright:

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

    A69 DS Ass1

    Uploaded by

    Shruti Punekar
    Data structures assignment

    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 5

    ASSIGNMENT NUMBER 1:-

    ROLL NO :- A-69

    AIM:- IMPLEMEMTATION OF STACK USING ARRAY

    #include <stdlib.h>
    #define SIZE 4

    int top = -1, inp_array[SIZE];

    void push();

    void pop();

    void show();

    int main()

    int choice;

    while (1)

    printf("\nPerform operations on the 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 the element to be added onto the stack: ");

    scanf("%d", &x);

    top = top + 1;

    inp_array[top] = x;

    void pop()

    if (top == -1)

    printf("\nUnderflow!!");

    else

    printf("\nPopped element: %d", inp_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", inp_array[i]);

    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