Stack Implementation using C in simple Codes and Explanation

What is Stack in Data Structures ?

So Basically Stack Is a Linear data structures and takes similar types of elements like array and store in memory using LIFO approaches . LIFO that's means Last in first out whereas last elements insert and remove first from the memory or stack . it is also called FILO means first in last out that's means first element insert and remove last.That's easy explanation of stack.

For Example ------ A bundle of Books in Library
Bundles of Plates etc.

Operations Performs on Stack

There are two operations perform on Stack -----

1.) Push

2.) Pop 

1,) Push--When we insert elements in stack then it is called Push operation.

Algorithm for Push Operation------

1.) Check if the stack is full or not.we declare a variable max and initialize with array of size and we check condition if top of the stack == to max-1  then we print a message to user StackOverflow.

2.) If the stack is not full, then increment the top=-1 to top++ and add the element in to the stack.

Algorithm for POP operation---------

1.) Check if the stack is empty or not by using condition if(top==-1) then print stack underflow.

2.) If the stack is empty, then print error of underflow and exit the program.If the stack is not empty, then print the element at the top and decrement the top=-1 to top-- .

Implementation Of Stack Using C-Language 

Explanation of program in easy steps ------ 

1. First we declare variable top and initialize with -1 because array starts with 0 and after increment -1 converts in to 0 that's -1+1=0.
2. we create an array name int array[max] . we declare after header file #define max 5 using symbolic constant that's means we write max instead of 5.
3. we take int variable choice for switch case and int value for insert in stack and int i for loop.
4. we create 3 methods for stack void push() , void pop() , void display() . 
5. In push method we check condition if stack array size == to top then stack will be Overflow otherwise we insert element and top==-1 will be increment and array[top] means array[0] = value ;
6. In pop method we check condition if stack top == -1 then stack will be Underflow no elements to be pop otherwise we delete element and top==-1 will be decrement back to -1 from 0 and array[top] means array[0] = value will be delete .
7. In display method we again check if top==-1 then we print stack is empty no elements are present in stack. else we take a for loop initialize with 0 and goes to top of the stack means if we push 2 value  in the stack then after increment stack will be 0 , 1 and i=0 and i=1 and for loop prints array[0]=value , array[1]=value.Last Explanation is we declare and define all functions and function related variable  outside the main method because in c language we don't declare functions inside the main method so we declare it Globally.

Before we going to read whole source code i request you to read full explanation of program to score good marks in diploma.Thanks Amit...........  

Here is the full source code in C-Programming in easy steps------

#include<stdio.h> #include<conio.h> #define max 5 void push(); void pop(); void display(); int array[max],value,i,top=-1; int main() { int choice; int userchoice=1; printf("Enter your specific operation----\n"); do { printf("1.) PUSH--\n"); printf("2.) POP--\n"); printf("3. DISPLAY--\n"); scanf("%d",&choice); switch(choice) { case 1: push(); break; case 2: pop(); break; case 3: display(); break; default: printf("--Wrong Input--"); } printf("--Do you want to continue press 1 for yes other key fot no--\n"); scanf("%d",&userchoice); } while(userchoice==1); } void push() { if(top==max-1) { printf("--StackOverflow--\n"); } else { printf("Enter value to be insert in Stack--\n"); scanf("%d",&value); top++; array[top] = value; printf("--Value are successfully inserted--\n"); } } void pop() { if(top==-1) { printf("--StackUnderflow--"); } else { printf("Elements from stack are Pop--%d\n",array[top]); top--; } } void display() { if(top==-1) { printf("Stack is empty no elements are present in stack--\n"); } else { printf("Elements are stack are----\n"); for(i=0;i<=top;i++) { printf("%d\n",array[i]); } } }

Download this full code press here









Here is the output of this code -------



Enter your specific operation----
1.) PUSH--
2.) POP--
3.  DISPLAY--
1
Enter value to be insert in Stack--
95
--Value are successfully inserted--
--Do you want to continue press 1 for yes other key for no--
1
1.) PUSH--
2.) POP--
3.  DISPLAY--
1
Enter value to be insert in Stack--
78
--Value are successfully inserted--
--Do you want to continue press 1 for yes other key for no--
1
1.) PUSH--
2.) POP--
3.  DISPLAY--
3
Elements are stack are----
95
78
--Do you want to continue press 1 for yes other key for no--
1
1.) PUSH--
2.) POP--
3.  DISPLAY--
2
Elements from stack are Pop--78
--Do you want to continue press 1 for yes other key for no--
1
1.) PUSH--
2.) POP--
3.  DISPLAY--
3
Elements are stack are----
95
--Do you want to continue press 1 for yes other key for no--
2

Compilation terminate because of wrong input.

--------------------------------
Process exited after 20.21 seconds with return value 0

Press any key to continue . . .

#StayHome

Also read-oops concepts in java with simple codes and examples

Also read-Java Program For Musical Instruments