#include 
typedef struct node
{
    int data;
    struct node *link;
}NODE;

void Push(int);
int  pop();
void Display();
NODE *top=NULL;   /* Global Declarations */

main()
{
    /* Main Program */
    int opn,elem;
    do
    {
        clrscr();
        printf("\n ### Linked List Implementation of STACK Operations ### \n\n");
        printf("\n Press 1-Push, 2-Pop, 3-Display,4-Exit\n");
        printf("\n Your option ? ");
        scanf("%d",&opn);
        switch(opn)
        {
        case 1:
            printf("\n\nRead the Element tobe pushed ?");
            scanf("%d",&elem);
            Push(elem);
            break;
        case 2:
            elem=Pop();
            if(elem != -1)
                printf(" Deleted Node(From Top)with the Data: %d\n",elem);
            break;
        case 3: printf("Linked List Implementation of Stack: Status:\n");
            Display(); break;
        case 4: printf("\n\n Terminating \n\n"); break;
        default: printf("\n\nInvalid Option !!! Try Again !! \n\n");
            break;
        }
        printf("\n\n\n\n  Press a Key to Continue . . . ");
        getch();
    }while(opn != 4);
}

void Push(int info)
{
    NODE *temp;
    temp=(NODE *)malloc(sizeof(NODE));
    if( temp == NULL)
        printf(" Out of Memory !! Overflow !!!");
    else
    {
        temp->data=info;
        temp->link=top;
        top=temp;
        printf(" Node has been inserted at Top(Front) Successfully !!");
    }
}

int Pop()
{
    int info;
    NODE *t;
    if( top ==  NULL) { printf(" Underflow!!!"); return -1; }
    else
    {
        t=top;
        info=top->data;
        top=top->link;
        t->link=NULL;
        free(t);
        return(info);
    }
}

void Display()
{
    NODE *t;
    if( top == NULL) printf("Empty Stack\n");
    else
    {
        t=top;
        printf("Top->");
        while(t)
        {
            printf("[%d]->",t->data);
            t=t->link;
        }
        printf("Null\n");
    }
}

The post C Program to implement STACK operations using Linked Lists first appeared on Student Projects.

#define SIZE 5            /* Size of Stack */
int s[SIZE],top=-1;       /* Global declarations */

push(int elem)
{                       /* Function for PUSH operation */
    if( Sfull()) printf("\n\n Overflow!!!!\n\n");
    else
    {
        ++top;
        s[top]=elem;
    }
}

int pop()
{                      /* Function for POP operation */
    int elem;
    if(Sempty()){ printf("\n\nUnderflow!!!!\n\n");
    return(-1); }
    else
    {
        elem=s[top];
        top--;
        return(elem);
    }
}

int Sfull()
{                     /* Function to Check Stack Full */
    if(top == SIZE-1) return 1;
    return 0;
}

int Sempty()
{                    /* Function to Check Stack Empty */
    if(top == -1) return 1;
    return 0;
}

display()
{                  /* Function to display status of Stack */
    int i;
    if(Sempty()) printf(" \n Empty Stack\n");
    else
    {
        for(i=0;i<=top;i++)
            printf("%d\n",s[i]);
        printf("^Top");
    }
}

main()
{                         /* Main Program */
    int opn,elem;
    do
    {
        clrscr();
        printf("\n ### Stack Operations ### \n\n");
        printf("\n Press 1-Push, 2-Pop,3-Display,4-Exit\n");
        printf("\n Your option ? ");
        scanf("%d",&opn);
        switch(opn)
        {
        case 1: printf("\n\nRead the element to be pushed ?");
            scanf("%d",&elem);
            push(elem); break;
        case 2: elem=pop();
            if( elem != -1)
                printf("\n\nPopped Element is %d \n",elem);
            break;
        case 3: printf("\n\nStatus of Stack\n\n");
            display(); break;
        case 4: printf("\n\n Terminating \n\n"); break;
        default: printf("\n\nInvalid Option !!! Try Again !! \n\n");
            break;
        }
        printf("\n\n\n\n  Press a Key to Continue . . . ");
        getch();
    }while(opn != 4);
}

The post C Program for Stack Operations – Using Array first appeared on Student Projects.

#include
#include
#include
#define size 100
int top=-1;
int flag=0;
int stack[size];
void push(int *,int);
int pop(int *);
void display(int *);
void push(int s[],int d)
{
    if(top==(size-1))
        flag=0;
    else
    {
        flag=1;
        ++top;
        s[top]=d;
    }
}
int pop(int s[])
{
    int popped_element;
    if(top==-1)
    {
        popped_element=0;
        flag=0;
    }
    else
    {
        flag=1;
        popped_element=s[top];
        --top;
    }
    return(popped_element);
}
void display(int s[])
{
    int i;
    if(top==-1)
    {
        printf("\n stack is empty");
    }
    else
    {
        for(i=top;i>=0;--i)
            printf("\n %d",s[i]);
    }
}
/* this is the main function */
void main()
{
    int data;
    char choice;
    int q=0;
    int top=-1;
    clrscr();
    do
    {
        printf("\n push->i pop->p quit->q:");
        printf("enter your choice");
        do
        {
            choice=getchar();
            choice=tolower(choice);
        }
        while(strchr("ipq",choice)==NULL);
        printf("your choice is %c",choice);
        switch(choice)
        {
        case'i':printf("\n input element to push");
            scanf("%d",&data);
            push(stack,data);
            if(flag)
            {
                printf("\n after inserting ");
                display(stack);
                if(top==(size-1))
                    printf("\n stack is full");
            }
            else
                printf("\n stack is overflown after pushing");
            break;
        case 'p':data=pop(stack);
            if(flag)
            {
                printf("\n data is popped:%d",data);
                printf("\n now the stack is as follows :\n");
                display(stack);
            }
            else
                printf("\n stack is underflown");
            break;
        case'q':q=1;
        }
    }
    while(!q);
}

The post C program to implement stack operations using array first appeared on Student Projects.

 
#include
#include
#include
#include
#define max 20

int top=-1,s[max];
void push(int n)
{
    if(top==max-1)
    {
        puts("stack is over flown");
        return;
    }
    else
    {
        top=top+1;
        s[top]=n;
    }
}
void pop()
{
    int del;
    if(top==-1)
    {
        puts("stack is underflown");
        return;
    }
    else
    {
        del=s[top];
        printf("\n poped element is %d",del);
        top=top-1;
    }
}
void display()
{
    int i;
    if(top==-1)
        puts("stack is empty");
    else
    {
        for(i=top;i>=0;i--)
            printf("\t%d",s[i]);
    }
}
void main()
{
    int opt,n;
    do
    {
        printf("\n 1.push");
        printf("\n 2.pop");
        printf("\n 3.display");
        printf("\n 4.exit");
        printf("enter ur option");
        scanf("%d",&opt);
        switch(opt)
        {
        case1:printf("\n enter any element to push");
            scanf("%d",&n);
            break;
        case2:pop();
            break;
        case3:display();
            break;
        case4:exit(0);
            break;
        }
    }
    while(1);
}

The post C Program which performs stack operations first appeared on Student Projects.