Scribd Logo
Upload

Welcome to Scribd!

  • 29 views

    Program 3

    Uploaded by

    PathanjaliChowdaiah
    data structure program

    Copyright:

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

    Program 3

    Uploaded by

    PathanjaliChowdaiah
    29 views4 pages
    data structure program

    Original Title

    program 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?

    data structure program

    Copyright:

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

    Program 3

    Uploaded by

    PathanjaliChowdaiah
    data structure program

    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 4

    #include<stdlib.

    h>

    #include<stdio.h>

    #include<string.h>

    #define max_size 5

    int stack[max_size], top = -1;

    int a[10], n;

    void push() //Inserting element into the stack

    int item;

    if (top == (max_size - 1))

    printf("\nStack Overflow:");

    else

    printf("Enter the element to be inserted:\t");

    scanf("%d", &item);

    top = top + 1;

    stack[top] = item;

    void pop() //deleting an element from the stack

    int item;

    if (top == -1)

    printf("Stack Underflow:");

    else

    item = stack[top];

    top = top - 1;

    printf("\nThe poped element: %d\t", item);


    }

    void display() //Display function

    int i;

    if (top == -1)

    printf("Stack Empty\n");

    else

    printf("Elements Are:\n");

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

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

    int palindrome() //Palindrome

    int k, len = top + 1, rev[max_size], i, j = 0;

    if (top == -1)

    printf("Stack Empty\n");

    else

    printf("Array elements are : \n"); //displaying array elements

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

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

    for (k = len - 1; k >= 0; k--, j++) //performing reverse operation

    rev[k] = stack[j];

    printf("\n reverse array : \n");

    for (k = 0; k<len; k++)

    printf("%d\t", rev[k]);
    for (i = 0; i<len; i++) //check for palindrome

    if (stack[i] != rev[i])

    break;

    if (i == len)

    printf("\n It is palindrome number\n");

    else

    printf("\n It is not a palindrome number\n");

    return 0;

    int main()

    int choice;

    while (1)

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

    printf("1.Push\n");

    printf("2.Pop\n");

    printf("3.Palindrome\n");

    printf("4.Display\n");

    printf("5.Exit\n");

    printf("-----------------------");

    printf("\nEnter your choice:\t");

    scanf_s("%d", &choice);

    switch (choice)

    case 1:push();

    break;
    case 2:pop();

    break;

    case 3:palindrome();

    break;

    case 4:display();

    break;

    case 5:exit(0);

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

    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