Question

Using C

2.A Stack data structure with at least following functions pushO - Insert an element at one end of the stack called top. )-Remove and return the element at the top of the stack, if it is not empty. "peek0- Return the element at the top of the stack without removing it, if the stack is not empty. size0 -Return the number of elements in the stack. isEmpty0-Return true if the stack is empty, otherwise return false isFullO-Return true if the stack is full, otherwise return false. You can also write your own c++ program to implement the same., I

Answer 1

Code: (HomeworkLib submission portal automatically removes backslash n , Hence i have added the screenshot of code too)

#include<stdio.h>
#define MAX 5 // Maximum size of array
int top = -1;
int stack_arr[MAX];
int isFull()
{
if(top==MAX-1)
return 1;
else
return 0;
}
int isEmpty()
{
if(top==-1)
return 1;
else
return 0;
  
}
void push()
{
   int x;
   if(isFull()==1)
       printf("Stack Overflow ");
   else
   {
       printf("Enter the item to be pushed in stack : ");
       scanf("%d",&x);
       top=top+1;
       stack_arr[top] = x;
   }
}

int pop()
{
int x=-1000; // It is garbage value
   if(isEmpty()==1)
       printf("Stack Underflow ");
   else
   {
   x=stack_arr[top];
       top=top-1;
   }
   return x;
}
int size()
{
return (top+1);
}
int peek()
{
int x=-1000;
   if(isEmpty()==1)
       printf("Stack Underflow ");
   else
   {
   x=stack_arr[top];
   }
   return x;
}
int main()
{
   int choice,x;

   do{
       printf("1.Push 2.Pop 3.Peek 4.Size 5.Quit ");
       printf("Enter your choice : ");
       scanf("%d",&choice);
       switch(choice)
       {
       case 1 :
           push();
           break;
       case 2:
       x=pop();
           printf("Popped element is : %d ",x);
           break;
       case 3:
       x=peek();
           printf("Top element is : %d ",x);
           break;
       case 4:
       x=size();
       printf("Size of the stack is: %d ",x);
       case 5:
break;
       default:
           printf("Wrong choice ");
       }}while(choice!=5);
       return 0;
}

Output:

Screenshot:

8 9 #include<stdio.h> 10 #define MAX 5 // Maximum size of array 11 int top-1; 12 int stack_arr[MAX]; 13 int isFull() 14 15 16 17 18 19 20 int isEmpty() 21 if(top--MAX-1) return 1; else return e; if (top-1) 23 24 25 26 27 28 void push() 29 30 31 32 return 1; else return e; int x; if(isFul1()--1) printf("Stack Overflow n"); else 34 35 36 37 38 39 40 printf("Enter the item to be scanf("%d",&x); top-top+1; stack_arr [top] -x; pushed in stack: ");
$69 int main 70 71 72 73 74 75 76 int choice,x; printf(1.Push 2.Pop 3.Peek 4.Size printf(Enter your choice : ); scanf(%d , & choice); switch(choice) 5.Quit n); 78 79 80 81 82 83 84 85 86 87 case 1 push(); break case 2: x-pop(); printf(Popped break element is : %d\n,x); case 3: x-peek): printf(Top element break is : %d\n,x); 89 90 91 92 93 94 95 96 97 98 case 4: x-size(); printf(Size of the stack is: %d\n,x); case 5: break default: printf(Wrong choice\n); ))while (choice ! ); return e; 100$