Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    3

    Uploaded by

    darshangowda0525
    dsa 3

    Copyright:

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

    3

    Uploaded by

    darshangowda0525
    5 views2 pages
    dsa 3

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    dsa 3

    Copyright:

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

    3

    Uploaded by

    darshangowda0525
    dsa 3

    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 2

    #include<stdio.

    h>
    #include<conio.h>
    #define MAX 4

    int stack[MAX], item;


    int ch, top = -1, count = 0, status = 0;

    /* PUSH FUNCTION */
    void push(int stack[], int item)
    {
    if (top == (MAX-1))
    printf("\n\nStack is Overflow");
    else
    {
    stack[++top] = item;
    status++;
    }
    }

    /* POP FUNCTION */
    int pop(int stack[])
    {
    int ret;
    if(top == -1)
    printf("\n\nStack is Underflow");
    else
    {
    ret = stack[top--];
    status--;
    printf("\nPopped element is %d", ret);
    }
    return ret;
    }

    void palindrome(int stack[])


    {
    int i, temp;
    temp = status;
    for(i=0; i<temp; i++)
    {
    if(stack[i] == pop(stack))
    count++;
    }
    if(temp == count)
    printf("\nStack contents are Palindrome");
    else
    printf("\nStack contents are not palindrome");
    }

    void display(int stack[])


    {
    int i;
    printf("\nThe stack contents are:");
    if(top == -1)
    printf("\nStack is Empty");
    else{
    for(i=top; i>=0; i--)
    printf("\n ------\n| %d |", stack[i]);
    printf("\n");
    }
    }

    void main()
    {
    do{
    printf("\n\n----MAIN MENU----\n");
    printf("1. PUSH (Insert) in the Stack");
    printf("\n2. POP (Delete) from the Stack");
    printf("\n3. PALINDROME check using Stack");
    printf("\n4. Exit (End the Execution)");
    printf("\nEnter Your Choice: ");
    scanf("%d", &ch);

    switch(ch){
    case 1:
    printf("\nEnter an element to be pushed: ");
    scanf("%d", &item);
    push(stack, item);
    display(stack);
    break;
    case 2:
    item = pop(stack);
    display(stack);
    break;
    case 3:
    palindrome(stack);
    break;
    case 4:
    exit(0);
    break;
    default:
    printf("\nEND OF EXECUTION");
    }// end switch
    } while (ch != 4);

    getch();
    }

    You might also like