Skip to main content

Stack using C++(Struct)

 Q). Implement Stack push and pop function using struct in C++


=>Program :


#include<iostream>

#include<iomanip>

using namespace std;

#define MAX 5


typedef struct stack_node{


  int arr[MAX];

  int top;


}node;


void push(int item,node *ptr);

int pop(node *ptr);

void display(node *ptr);


int main(){


int item,choice;

char ch;


node myStack;


myStack.top=-1;



do{


    cout<<"\n************* please press below key for that option *************\n\n";

    cout<<"1.Push Value in stack \n";

    cout<<"2.Pop Value in stack \n";

    cout<<"3.Display \n";

    cin>>choice;


    switch(choice){

     case 1: cout<<"Enter the data : ";

             cin>>item;

             push(item,&myStack);

             break;


     case 2: item=pop(&myStack);

             cout<<"Pop element : "<<item<<endl;

             break;


      case 3: display(&myStack);

              break;


      default : cout<<"Wrong option selected\n";


    }


    cout<<"\nDo you want to run again (y/n) : ";

    cin>>ch;


}while(ch=='y');


}



void push(int item,node *ptr){


if(ptr->top==MAX-1){


cout<<"\nStack Over Flow \n";


}else{


ptr->top++;

ptr->arr[ptr->top]=item;

cout<<"\nStack Push at "<<ptr->top+1<<" position"<<endl;


}


}



int pop(node *ptr){


int item;


if(ptr->top==-1){


cout<<"\nStack Over Flow \n";


}else{


item=ptr->arr[ptr->top];

cout<<"\nStack Pop at "<<ptr->top+1<<" position"<<endl;

ptr->top--;


}

return item;

}



void display(node *ptr){


cout<<"\n\n ********* Stack Status **********\n\n";


for(int i=MAX;i>0;i--){


   if(ptr->top<i-1){

    cout<<setw(4)<<i<<setw(4)<<"|"<<setw(8)<<"|"<<endl;

    cout<<setw(8)<<"|"<<"_______"<<"|"<<endl;

   }else{

    cout<<setw(4)<<i<<setw(4)<<"|"<<setw(4)<<ptr->arr[i-1]<<setw(4)<<"|"<<endl;

    cout<<setw(8)<<"|"<<"_______"<<"|"<<endl;

   }



}


if(ptr->top==MAX-1){

    cout<<endl;

    cout<<setw(8)<<"  "<<"FULL"<<" "<<endl;

}


if(ptr->top==-1){

    cout<<endl;

    cout<<setw(8)<<"  "<<"EMPTY"<<" "<<endl;

}


}


=> Output : 


1. Option Sample:




  =>Full Stack Sample:

                  



=>Empty Stack Sample :







Labels:

Comments

Post a Comment

Popular posts from this blog

Maximum possible number of monsters you can defeat?

 Q).Maximum possible number of monsters you can defeat?  =>Introduction: While playing an RPG game, you were assigned to complete one of the hardest quests in this game. There are n monsters you'll need to defeat in this quest. Each monster i is described with two integer numbers - poweri and bonusi. To defeat this monster, you'll need at least poweri experience points. If you try fighting this monster without having enough experience points, you lose immediately. You will also gain bonusi experience points if you defeat this monster. You can defeat monsters in any order. The quest turned out to be very hard - you try to defeat the monsters but keep losing repeatedly. Your friend told you that this quest is impossible to complete. Knowing that, you're interested, what is the maximum possible number of monsters you can defeat? (Question difficulty level: Hardest) => Input: The first line contains an integer, n, denoting the number of monsters. The next line contains an
Post a Comment
Read more

Count Frequency of Character in Any Sentence using C++

 Q)Write the C++ program for character frequency count for any sentence => Program : #include<iostream> #include<string> #include<iomanip> using namespace std; int main(){ string mystr; cout<<"Enter the Any Sentence  for character frequency count \n"; getline(cin,mystr); int charFreq[26]={0}; for(int i=0;i<mystr.length();i++){     int index=mystr[i]-'a';     charFreq[index]++; } cout<<"\n****************************************\n"; cout<<"\nSentence : "<<mystr<<endl<<endl; cout<<setw(12)<<"Character"<<setw(12)<<"Frequency"<<endl<<endl; for(int i=0;i<26;i++){     if(charFreq[i]!=0){         cout<<setw(6)<<char(i+'a')<<setw(10)<<charFreq[i]<<" times \n";     } } } =>Output :
Post a Comment
Read more