Stack Abstract Data Structure with Array Implementation

Stack is a abstract data type which store the elements in a particular order called Last in first out (LIFO), where insertion is called PUSH operation and deletion called POP operation.

The basic operations of stack are:

  1. PUSH insert the element into the stack
  2. POP deletion of the element from the stack
  3. PEEK return the TOP item of the stack
Stack implementation can be possible using:
  1. Linked List
  2. Array
Array implementation of stack  has following advantages and disadvantages:

Advantages: Best Performance
Disadvantage: Fixed Size


Stack Applications
  1. Compiler (parsing the data between the brackets)
  2. Operating system (program stack)
  3. Artificial intelligence(finding the path)
Stack implementation using an array:
  1. First define the size of the array
  2. Take a index variable called TOP=-1
  3. If TOP==MAX then stack is full
  4. If TOP==-1 stack is empty
  5. PUSH operation is performed with increment of TOP
  6. POP operation is performed with TOP decrements


#include
#include
#define MAX 10

int a[MAX];
int top=-1;

void Push()
{
int i;
if(top==MAX)
{
printf("stack is full");
exit(0);
}
else
{
scanf("%d",&i);
top++;
a[top]=i;
printf("insert is sucessful\n");
}
}

void Pop()
{
if(top==-1)
{
printf("stack is empty");
exit(0);
}
else
{
printf("%d\n", a[top]);
top=top-1;
}
}

void display()
{
if(top==-1)
{
printf("stack is empty");
exit(0);
}
else
{
while(top!=-1)
printf("poped all elements are %d\n",a[top--]);
}
}

int main()
{
int n,c;
while(1)
{
printf("1: Push operation into stack\n");
printf("2: POP operation into stack\n");
printf("3: Display all the pop elements\n");
printf("4: exit\n");
printf("enter the choice");
scanf("%d",&n);
switch(n)
{
case 1:
    printf("enter the data");
    Push();
    break;
case 2: 
   printf("poped elements");
   Pop();
   break;
case 3:
   display();
   break;
case 4:
   exit(0);
default :
   printf("invalid choice");
}
}
}


Comments

Post a Comment

Popular posts from this blog

Types of Algorithm and Its Complexity Analysis

Image
In this post, we will learn types of Algorithm and its time complexity analysis with examples  An algorithm is divided into two forms called iterative and recursive, as shown above. Firstly, we analyze the time complexity of the iterative algorithm and then recursive. Example 1:                           A()                           {                            int i;                            for(i=1 to n)   % loop run n times                            pf("deepa");                           } First, the above function is fall into the independent category. Hence, the running time of the loop will be n and it print the particular name n times. Therefore, the worst case time complexity of this algorithm will be O(n). Example 2:                          A()                         {                         int i;                         for(i=1, i^2<=n, i++)                         printf("deepa");                         } Similarly
Read more

First Step of Problem Solving Using Data Structure and Algorithm

Image
What is problem ? A state of difficulty that need to be resolve A problem exist and its solution needs to be  attain either correct or incorrect A problem gives an opportunity to improve the current state A problem is a difference between the  current state and goal state Problem Faced in daily life        Like making the decisions what should i wear today to look good? what career? what job? what shoes? what course? What happens when bad decisions are made ? Wastage of time and resource   Six steps to ensure  a Best decision in PROBLEM SOLVING Identify the problem first understand the problem Identify the different way to solve the problem (efficient) Select the best one solution among the various alternative solutions Identify the list of steps to solve a problem (instructions) Evaluate the solution of given problem (different set of inputs) Take the problem of and apply the six step of problem solving     A   Water Jug Pro
Read more

Asymptotic Notations

Image
 In computer science, any problem can be solved using the programming language. And a particular problem can have multiple solutions in terms of Algorithm. To find out which one is the best algorithm for a problem, we analyse it in terms of time and space.  To define the time and space complexity of an algorithm, we use the Asymptotic notation. Mostly three types of Asymptotic notation is widely preferred to represent the complexity of the algorithm. Big-O mathematically represented as O The X-axis of the above graph showing the size of the input (n) and Y axis showing the increase in  time (t) . In the graph,   f(n) function showing the increase of time as input   size   n is increasing for a particular algorithm. Beside, the another function called cg(n) showing the worst case of f(n) . Hence, in the above graph cg(n)  is above the f(n). If we bound the time complexity or f(n) of a given algorithm in terms of input n with another function called cg(n) for all
Read more