DSA Lab 7 Program

 Program for implementing Stack using array

#include <stdio.h>

int maxstack = 10;
int stack[10];
int top = -1;

int empty(){
    if(top == -1){
        return 1;
    }
    else{
        return 0;
    }
}

int full(){
    if(top == maxstack){
        return 1;
    }
    else{
        return 0;
    }
}

int peek(){
    return stack[top];
}

int pop(){
    int data;
    if(!empty()){
        data = stack[top];
        top -=1;
        printf("The data has been Deleted. Your data is %d \n", data);
        return data;
    }
    else{
        printf("The data Can't be Deleted. Becouse stack is empty \n");
    }
}

int push(int data){
    if(!full()){
        top += 1;
        stack[top] = data;
        printf("The data has been insterted. Your data is %d \n", data);
    }
    else{
        printf("The Data Can't be inserted in stack. because stack is full  \n");
    }
}

int main() {
    printf("Stack full: %s\n" , full()?"true":"false");
    printf("Stack empty: %s\n" , empty()?"true":"false");
   
    push(1);
    push(2);
    push(3);
    push(4);
    push(5);
    push(6);
    push(7);
    push(8);
    push(9);
    push(10);
    push(11);
    push(12);
    pop();
    pop();
    return 0;
}
# Output Stack full: false Stack empty: true The data has been insterted. Your data is 1 The data has been insterted. Your data is 2 The data has been insterted. Your data is 3 The data has been insterted. Your data is 4 The data has been insterted. Your data is 5 The data has been insterted. Your data is 6 The data has been insterted. Your data is 7 The data has been insterted. Your data is 8 The data has been insterted. Your data is 9 The data has been insterted. Your data is 10 The data has been insterted. Your data is 11 The Data Can't be inserted in stack. because stack is full The data has been Deleted. Your data is 11 The data has been Deleted. Your data is 10

Comments

Popular posts from this blog

Keyword , Identifier, Indentation, Comments & Documentation

DSA Lab 8 program