Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    3 Lab Program

    Uploaded by

    raghavlanger663
    The document contains a C program that implements stack operations using an array, allowing users to push and pop elements, and check if a string is a palindrome. It includes functions for pushing to the stack, popping from it, displaying stack elements, and checking for palindromes. The program runs in a loop until the user chooses to exit, handling invalid choices and stack overflow/underflow conditions.

    Copyright:

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

    3 Lab Program

    Uploaded by

    raghavlanger663
    3 views4 pages
    The document contains a C program that implements stack operations using an array, allowing users to push and pop elements, and check if a string is a palindrome. It includes functions for pushing to the stack, popping from it, displaying stack elements, and checking for palindromes. The program runs in a loop until the user chooses to exit, handling invalid choices and stack overflow/underflow conditions.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains a C program that implements stack operations using an array, allowing users to push and pop elements, and check if a string is a palindrome. It includes functions for pushing to the stack, popping from it, displaying stack elements, and checking for palindromes. The program runs in a loop until the user chooses to exit, handling invalid choices and stack overflow/underflow conditions.

    Copyright:

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

    3 Lab Program

    Uploaded by

    raghavlanger663
    The document contains a C program that implements stack operations using an array, allowing users to push and pop elements, and check if a string is a palindrome. It includes functions for pushing to the stack, popping from it, displaying stack elements, and checking for palindromes. The program runs in a loop until the user chooses to exit, handling invalid choices and stack overflow/underflow conditions.

    Copyright:

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

    #include<stdio.

    h>

    #include<string.h>

    #define MAX_SIZE 6

    void push(int[],int*,int);

    int pop(int[],int*);

    void display(int[],int);

    int palindrome(int[],int*,char[]);

    int main()

    int stack[MAX_SIZE],ele,deleted_item,top=-1,flag=-1,done=0,choice;

    char palstr[MAX_SIZE];

    while(!done)

    printf("\nSTACK OPERATIONS USING ARRAY");

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

    printf("Enter the choice:\n");

    scanf("%d",&choice);

    switch(choice)

    case 1: printf("Enter the element to be pushed\n");

    scanf("%d",&ele);

    push(stack,&top,ele);

    display(stack,top);

    break;

    case 2:deleted_item=pop(stack,&top);

    if(deleted_item!=-1)
    {

    printf("Deleted Item is: =%d\n",deleted_item);

    display(stack,top);

    break;

    case 3:printf("Enter the String\n");

    scanf("%s",palstr);

    top=-1;

    flag=palindrome(stack,&top,palstr);

    if(flag==1)

    printf("%s is a palindrome\n",palstr);

    else

    printf("%s is not a palindrom\n",palstr);

    top=-1;

    break;

    case 4:done=1;

    break;

    default:printf("Invalid Choice\n");

    return 0;

    void push(int stack[],int *top,int ele)

    if(*top==MAX_SIZE-1)

    printf("Stack Overflow\n");

    else
    {

    ++(*top);

    stack[*top]=ele;

    return;

    int pop(int stack[],int*top)

    int deleted_item;

    if(*top==-1)

    printf("Stack Underflow\n");

    return -1;

    else

    deleted_item=stack[*top];

    (*top)--;

    return deleted_item;

    void display(int stack[],int top)

    int i;

    if(top==-1)

    printf("Stack is Empty\n");

    else
    {

    printf("Stack Elements are\n");

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

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

    return;

    int palindrome(int stack[],int *top,char pal[])

    int i,p;

    for(i=0;i<strlen(pal);i++)

    push(stack,top,pal[i]);

    for(i=0;i<strlen(pal);i++)

    if(pal[i]!=pop(stack,top))

    return -1;

    return 1;

    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