Number Guessing Game

// number gussing game
#include<iostream>
#include <cstdlib>
#include<ctime>

using namespace std;
main()
{ // decleration of veriable
int num;
int guess;
bool isGuessed;
num = (rand() + time(0))% 100;
isGuessed = false;
cout<<"\n\t\tNumber Guessing Game"<<endl;
while (!isGuessed)
{
//cout<<"_______________________________________________________________________________"<<endl;
cout << "Enter an integer greater than or equal to 0 but less than 100:  " ;
cin >> guess ;
cout << endl;
if (guess==num)
{
cout<<"************************************************************"<<endl;
cout << "\n\tCONGRATULATION!  you guess the correct number \n." << endl;
cout<<"************************************************************"<<endl;
isGuessed=true;

}
else if (guess<num)
{
cout<<"Ooooopps1!\n\n YOUR GUESS IS LOWER THAN THE NUMBER.\n\n TRY AGAIN :)" << endl;
cout<<"_______________________________________________________________________________"<<endl;
}
else

 {
  cout << "Oh! YOUR GUESS IS HIGHER THAN THE NUMBER.\n\n "<< "GUESS AGAIN :)" << endl;
cout<<"_______________________________________________________________________________"<<endl;
}

}
return 0;


}

Implimentation of Simple Queue

#include<iostream>
using namespace std;
class list
{
private:
int queuerear;
int queuefront;
int maximumsize;
int queue[5];
int i;
int data;
public:
void initialize ();
bool isemptyqueue();
bool isfullqueue();
void insert(int num);
void deletee();
void print();
};
void list::initialize()
{
queuerear=-1;
queuefront=-1;
maximumsize=5;
}
bool list::isemptyqueue()
{
return(queuefront==-1);
}
bool list::isfullqueue()
{
return(queuerear== maximumsize);
}
void list::insert(int num)
{
if( isfullqueue())
{
cout<<"queue_is__full"<<endl;
}
else
{
queuerear++;
queue[queuerear]=num;
if(queuefront==-1)
queuefront=0;

}
}
void list::print()
{
if(isemptyqueue())
{
cout<<"queue is empty"<<endl;
}
else
{

cout<<"values_in_queue"<<endl;
for(i=queuefront;i<=queuerear;i++)
{
cout<<queue[i]<<endl;;
}
}
}
void list::deletee()
{
if(isemptyqueue())
{
cout<<"queue is empty"<<endl;
}
else{

cout<<"the service provide to queue as "<<endl;
queuefront++;
data= queue[queuefront];
// cout<<data<<endl;
}
if(queuerear==queuefront)
{
queuerear=queuefront=-1;
}
}
int main()
{
list obj;
obj.initialize();
int n,i,choice;
while(1)
{
cout<<"________________________________________"<<endl;
cout<<"enter 1 for enter data"<<endl;
cout<<"enter 2 for delete data"<<endl;
cout<<"enter 3 for show data in queue"<<endl;
cout<<"enter 4 to exit"<<endl;
cin>>choice;
cout<<"________________________________________"<<endl;
switch(choice)
{
case 1:
cout<<"enter queue values"<<endl;
cin>>n;
obj.insert(n);
break;
case 2:
obj.deletee();
break;
case 3:
obj.print();
break;
case 4:
return 0;
break;
default:
cout<<"in-valid choice"<<endl;

}
}
return 0;
}

Circular queue

#include<iostream>
using namespace std;
class list
{
private:
int queuerear;
int queuefront;
int maximumsize;
int queue[5];
int i;
int data;
public:
void initialize ();
bool isemptyqueue();
bool isfullqueue();
void insert(int num);
void deletee();
void print();
void show();
};
void list::initialize()
{
queuerear=-1;
queuefront=-1;
maximumsize=5;
}
bool list::isemptyqueue()
{
return(queuerear==-1);
}
bool list::isfullqueue()
{
return(queuerear== maximumsize);
}
void list::insert(int num)
{
if(((queuerear+1)%maximumsize==queuefront))
{
cout<<"queue_is__full"<<endl;
}
else
{

queuerear=(queuerear+1)%maximumsize;
queue[queuerear]=num;
queuefront=0;

}
}
void list::print()
{
if(isemptyqueue())
{
cout<<"queue is empty"<<endl;

}
else
{

if(queuefront<queuerear)
{
cout<<"values in your queue"<<endl;
for(i=queuefront;i<=queuerear;i++)
{
cout<<queue[i]<<endl;;
}
}
else
{
if(i=queuefront)
{

while(i<maximumsize)
{
cout<<queue[i];
i++;
}
}
else
{
i=0;
while(i<queuerear)
{
cout<<queue[i]<<",";
i++;
}
}
}
}
}
void list::deletee()
{
if(isemptyqueue())
{
cout<<"queue-is-empty";
}

else if(queuefront==queuerear)
queuefront=queuerear=-1;
else
{
queuefront=(queuefront+1)%maximumsize;
data=queue[queuefront];
}


}
void list::show()
{
if(isemptyqueue())
{
cout<<"queue is empty"<<endl;

}
else
{
cout<<"element at front is"<<queue[queuefront]<<endl;
}

}

int main()
{

list obj;
obj.initialize();
int n,i,choice;
while(1)
{
cout<<"___________________________________________________________________"<<endl;
cout<<"there are option to chose anyone according to your desire"<<endl;
cout<<"\t\tpress 1 for enter"<<endl;
cout<<"\t\tpress 2 for delete"<<endl;
cout<<"\t\tpress 3 for display"<<endl;
cout<<"\t\tpress 4 for exit"<<endl;
cin>>choice;
cout<<"____________________________________________________________________"<<endl;


switch(choice)
{
case 1:
cout<<"enter queue values"<<endl;
cin>>n;
obj.insert(n);
break;
        case 2:
obj.deletee();
        break;
        case 3:
        obj.print();
        case 4:
        break;
        default:
        cout<<"invalid choice"<<endl;
}
}


return 0;

}

PROGRAM TO COUNT CHARACTERS ALPHABETS NUMBERS AND SPACES IN A STRING

#include<iostream>
#include<stdio.h>
#include<string>
using namespace std;
void sum(int a,int b,int c,int d)
{
int sum=0;
sum =a+b+c+d;
cout<<"total string length is"<<sum;

}
int main()
{
char space;
string striing;
int i,countalphabtes=0, countspace=0,countnumbers=0,countspecialcharacters=0;
cout<<"enter string"<<endl;
//cin>> striing;
getline(cin ,striing);

for(i=0;striing[i]!='\0';i++)
{
if(striing[i]=='a'||striing[i]=='b'||striing[i]=='c'||striing[i]=='d'||striing[i]=='e'||
striing[i]=='f'||striing[i]=='g'||striing[i]=='h'||striing[i]=='i'||striing[i]=='j'||
striing[i]=='k'||striing[i]=='l'||striing[i]=='m'||striing[i]=='n'||striing[i]=='o'||
striing[i]=='p'||striing[i]=='q'||striing[i]=='r'||striing[i]=='s'||striing[i]=='t'||
striing[i]=='u'||striing[i]=='v'||striing[i]=='w'||striing[i]=='x'||striing[i]=='y'||
striing[i]=='z'||
striing[i]=='A'||striing[i]=='B'||striing[i]=='C'||striing[i]=='D'||striing[i]=='E'||
striing[i]=='F'||striing[i]=='g'||striing[i]=='H'||striing[i]=='I'||striing[i]=='J'||
striing[i]=='K'||striing[i]=='L'||striing[i]=='M'||striing[i]=='N'||striing[i]=='O'||
striing[i]=='P'||striing[i]=='Q'||striing[i]=='N'||striing[i]=='S'||striing[i]=='T'||
striing[i]=='U'||striing[i]=='V'||striing[i]=='W'||striing[i]=='X'||striing[i]=='Y'||striing[i]=='Z')
{
countalphabtes++;
}
// cout<< countalphabtes<<endl;
else if (striing[i]==' ')
{
countspace++;
}
// cout<< countspace<<endl;
else if(striing[i]=='0'||striing[i]=='1'||striing[i]=='2'||striing[i]=='3'||striing[i]=='4'||striing[i]=='5'||
striing[i]=='6'||striing[i]=='7'||striing[i]=='8'||striing[i]=='9')
{
countnumbers++;
}
// cout<<countnumbers<<endl;
else if(striing[i]=='!'||striing[i]=='@'||striing[i]=='#'||striing[i]=='$'||striing[i]=='%'||striing[i]=='^'||
striing[i]=='&'||striing[i]=='*'||striing[i]=='('||striing[i]==')'||striing[i]=='-'||striing[i]=='_'||striing[i]=='+'||striing[i]=='='
||striing[i]=='['||striing[i]==']'||
striing[i]== '{'||striing[i]=='}'||striing[i]=='?'||striing[i]=='/'||striing[i]=='`'||striing[i]=='~'
||
striing[i]== '|'||striing[i]==';'||striing[i]==':'||striing[i]=='.'||striing[i]==','||striing[i]=='<'||striing[i]=='>' )

{
countspecialcharacters++;

}
// cout<<countspecialcharacters<<endl;
}
cout<<"\n\tHey! user"<<endl;
cout<<"_____________________________________________________________"<<endl;
cout<<"_____________________________________________________________"<<endl;
cout<<"\n\talphabets in your srting:"<<countalphabtes<<endl;
cout<<"_____________________________________________________________"<<endl;
cout<<"\tspace used in this string:"<<countspace<<endl;
cout<<"_____________________________________________________________"<<endl;
cout<<"\tnumbers in this string:"<<countnumbers<<endl;
cout<<"_____________________________________________________________"<<endl;
cout<<"\tspecial character in this string:"<< countspecialcharacters<<endl;
cout<<"_____________________________________________________________"<<endl;
sum(countnumbers,countalphabtes,countspecialcharacters,countspace);
return 0;
}

Post fix expression sloution calculator using stack

#include<iostream>
using namespace std;

class stacktype
{
private:

char num[10];
char ch;
int arr[100];
int stacktop;
int a;
int var1,var2,var3;

public:
stacktype()
{
stacktop=-1;
}
void input();
void scan();
void push(int ch);
void pop();
void calculation(int var1,int var2);
void print();
};
void stacktype:: input()
{
cout<<"enter experation"<<endl;
cin>>num;
}
void stacktype:: scan()
{
for(int i=0;num[i]!='\0';i++)
{
ch=num[i];

if(ch=='1'||ch=='2'||ch=='3'||ch=='4'||ch=='5'||ch=='6'||ch=='7'||ch=='8'||ch=='9'||ch=='0')
{
if(ch=='1')
push(1);
else if(ch=='2')
push(2);
else if(ch=='3')
push(3);
else if(ch=='4')
push(4);
else if(ch=='5')
push(5);
else if(ch=='6')
push(6);
else if(ch=='7')
push(7);
else if(ch=='8')
push(8);
else if(ch=='9')
push(9);
else
push(0);
}
else if(ch!='+'||ch!='-'||ch!='/'||ch!='*')
{
pop();

}

}
}
void stacktype::push(int v)
{
stacktop++;
arr[stacktop]=(int)v;

cout<<arr[stacktop]<<endl;

}
void stacktype::pop()
{
var1=arr[stacktop];
stacktop--;

var2=arr[stacktop];
stacktop--;
calculation( var1,var2);

}
void stacktype::calculation(int var1,int var2)
{
switch(ch)
{
case'+':
{
var3=var1+var2;
push(var3);
break;
}
case'-':
{
var3=var1-var2;
push(var3);
break;
}
case'*':
{
var3=var1*var2;
push(var3);
break;
}
case'/':
var3=(int)var1/(int)var2;
push(var3);
break;
default:
cout<<"invalid case"<<endl;
}
}
void stacktype::print()
{
for(int i=0;i<=stacktop;i++)
cout<<arr[i]<<endl;
}


int main()

{
stacktype obj;
obj.input();
obj.scan();
obj.print();
return 0;


}