Scribd Logo
Upload

Welcome to Scribd!

  • 10 views

    Stack

    Uploaded by

    fizzzr83
    The document describes stack operations using an array implementation in C including push, pop, and display functions. Push adds an element to the top of the stack by incrementing the top index and assigning the value to that index in the array. Pop removes an element from the top by printing and decrementing top. Display prints all elements from top to 0 if top is greater than or equal to 0, otherwise reports the stack is empty. Sample output demonstrates using the functions with a stack of maximum size 10.

    Copyright:

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

    Stack

    Uploaded by

    fizzzr83
    10 views6 pages
    The document describes stack operations using an array implementation in C including push, pop, and display functions. Push adds an element to the top of the stack by incrementing the top index and assigning the value to that index in the array. Pop removes an element from the top by printing and decrementing top. Display prints all elements from top to 0 if top is greater than or equal to 0, otherwise reports the stack is empty. Sample output demonstrates using the functions with a stack of maximum size 10.

    Original Title

    stack

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes stack operations using an array implementation in C including push, pop, and display functions. Push adds an element to the top of the stack by incrementing the top index and assigning the value to that index in the array. Pop removes an element from the top by printing and decrementing top. Display prints all elements from top to 0 if top is greater than or equal to 0, otherwise reports the stack is empty. Sample output demonstrates using the functions with a stack of maximum size 10.

    Copyright:

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

    Stack

    Uploaded by

    fizzzr83
    The document describes stack operations using an array implementation in C including push, pop, and display functions. Push adds an element to the top of the stack by incrementing the top index and assigning the value to that index in the array. Pop removes an element from the top by printing and decrementing top. Display prints all elements from top to 0 if top is greater than or equal to 0, otherwise reports the stack is empty. Sample output demonstrates using the functions with a stack of maximum size 10.

    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 6

    Operations in STACK (Linear Data Structure)

    1. Push
    2. Pop
    3. Display

    A shown in the figure above , STACK is represented in the form of array,say a[10]. Operation
    (addition, deletion and display of contents) can be done mainly with the help of the index i. As we
    already know that in a Stack, we add new element in the top of the stack and deletion of element is
    also done from the top of the stack which means we obey Last in first out OR First in last Out
    mechanism of operation.

    To add new element (function to add new element)

    void push()
    {
    if(top>=n-1)
    {
    printf("\n\tSTACK is over flow");

    }
    else
    {
    printf(" Enter a value to be pushed:");
    scanf("%d",&x);
    top++;
    stack[top]=x;
    }
    }

    Stack hi size neisa anih vangin a full ve thei a chumi check nan chuan overflow condition
    ‘if(top>=n-1)’ kan nei ani. top hi variable ani a, he varia ble hian a index value hrang hrnag a entir
    zel a, pakht kan push a piangin top hi kan increase zel ang a, ala full loh chuan stack[top] ah kan element thar
    kha kan asiign zel ang. stack[top]=x.

    Delete the Items

    Stack atanga item delete dan ani e. Anihna tak ah chuan engemah kan delete theilo a, kan stack huam chin kan
    sawr zim mai chauh ani. top in a huam chin kha pakhati kan ti tlem a, a chungber kha stack zingah kan chhiar
    talo mai ani.

    void pop()
    {
    if(top<=-1)
    {
    printf("\n\t Stack is under flow");
    }
    else
    {
    printf("\n\t The popped elements is %d",stack[top]);
    top--;
    }
    }

    Chumi ti tu ber chu top—tih hi ani.

    Display the contents

    Stack a kan neih zawng zawng end an ani mai a…

    void display()
    {
    if(top>=0)
    {
    printf("\n The elements in STACK \n");
    for(i=top; i>=0; i--)
    printf("\n%d",stack[i]);
    printf("\n Press Next Choice");
    }
    else
    {
    printf("\n The STACK is empty");
    }

    Now please see and examine the different operations in the DS, work out the following Program and
    show me how you’ve done them.

    #include<stdio.h>
    int stack[100],choice,n,top,x,i;
    void push(void);
    void pop(void);
    void display(void);
    int main()
    {
    //clrscr();
    top=-1;
    printf("\n Enter the size of STACK[MAX=100]:");
    scanf("%d",&n);
    printf("\n\t STACK OPERATIONS USING ARRAY");
    printf("\n\t--------------------------------");
    printf("\n\t 1.PUSH\n\t 2.POP\n\t 3.DISPLAY\n\t 4.EXIT");
    do
    {
    printf("\n Enter the Choice:");
    scanf("%d",&choice);
    switch(choice)
    {
    case 1:
    {
    push();
    break;
    }
    case 2:
    {
    pop();
    break;
    }
    case 3:
    {
    display();
    break;
    }
    case 4:
    {
    printf("\n\t EXIT POINT ");
    break;
    }
    default:
    {
    printf ("\n\t Please Enter a Valid Choice(1/2/3/4)");
    }

    }
    }
    while(choice!=4);
    return 0;
    }
    void push()
    {
    if(top>=n-1)
    {
    printf("\n\tSTACK is over flow");

    }
    else
    {
    printf(" Enter a value to be pushed:");
    scanf("%d",&x);
    top++;
    stack[top]=x;
    }
    }
    void pop()
    {
    if(top<=-1)
    {
    printf("\n\t Stack is under flow");
    }
    else
    {
    printf("\n\t The popped elements is %d",stack[top]);
    top--;
    }
    }
    void display()
    {
    if(top>=0)
    {
    printf("\n The elements in STACK \n");
    for(i=top; i>=0; i--)
    printf("\n%d",stack[i]);
    printf("\n Press Next Choice");
    }
    else
    {
    printf("\n The STACK is empty");
    }

    }
    Output

    Enter the size of STACK[MAX=100]:10

    STACK OPERATIONS USING ARRAY


    --------------------------------
    1.PUSH
    2.POP
    3.DISPLAY
    4.EXIT
    Enter the Choice:1
    Enter a value to be pushed:12

    Enter the Choice:1


    Enter a value to be pushed:24

    Enter the Choice:1


    Enter a value to be pushed:98

    Enter the Choice:3

    The elements in STACK

    98
    24
    12
    Press Next Choice
    Enter the Choice:2

    The popped elements is 98


    Enter the Choice:3

    The elements in STACK

    24
    12
    Press Next Choice
    Enter the Choice:4

    EXIT POINT

    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