Lab_prog03.c

#include<stdlib.h>
#include<stdio.h> 
#include<string.h>

#define max_size 5 

int stack[max_size],top = -1; 
void push(); 
void pop(); 
void display(); 
void pali(); 
int main(){ 
    int choice; 
    while(choice){ 
        printf("\nSTACK OPERATIONS\n");
        printf("1.Push\n");
        printf("2.Pop\n");
        printf("3.Palindrome\n");
        printf("4.Display\n");
        printf("5.Exit\n");
        printf("\nEnter your choice:\t"); 
        scanf("%d",&choice); 
        switch(choice){ 
            case 1: 
                push(); 
                break; 
            case 2: 
                pop(); 
                break; 
            case 3: 
                pali(); 
                break; 
            case 4: 
                display(); 
                break; 
            case 5: 
                exit(0); 
                break; 
            default: 
                printf("\nInvalid choice:\n"); 
                break; 
        } 
    } 
    return 0; 
} 
//Inserting element into the stack
void push(){ 
    int item,n; 
    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; 
    } 
}
//deleting an element from the stack
void pop(){ 
    int item; 
    if(top==-1){ 
        printf("Stack Underflow:");
    } 
    else{ 
        item=stack[top]; 
        top=top-1; 
        printf("\nThe poped element: %d\t",item); 
    } 
}

void pali(){ 
    int digit,j,k,len=top+1,flag=0,ind=0 ,length = 0; 
    int num[len],rev[len],i=0; 
    while(top!=-1){ 
        digit= stack[top]; 
        num[i]=digit; 
        top--; 
        i++; 
    } 
    for(j=0;j<len;j++){ 
    printf("Numbers= %d\n",num[j]); 
    } 
    printf("reverse operation : \n"); 
    for(k=len-1;k>=0;k--){ 
    rev[k]=num[ind]; 
    ind++; 
    } 
    printf("reverse array : ");
    for(k=0;k<len;k++){ 
    printf("%d\n",rev[k]); 
    } 
    printf("check for palindrome :\n");
    for(i=0;i<len;i++){ 
        if(num[i]==rev[i]){ 
            length = length+1; 
        } 
    }  
    if(length==len){ 
        printf("It is palindrome number\n");
    } 
    else{ 
        printf("It is not a palindrome number\n");
    } 
    top = len-1;
}

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