Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Program is to perform string operations:
Program is to perform string operation without using in built functions using classes and object
void mainmenu()
{
clrscr();
cout<<"\n\t Enter your choice\n ";
cout<<"\n\t1. to read the string ";
cout<<"\n\t2. to display the string ";
cout<<"\n\t3. to reverse the string ";
cout<<"\n\t4. to capitalize the string ";
cout<<"\n\t5. to copy the string into an empty string";
cout<<"\n\t6. to count the no. of vowels [upper and lower case] ";
cout<<"\n\t7. Quit ";
cout<<"\n\n\t Enter choice ";
}
class string
private:
char str[100];
public:
void read();
void display();
void capital();
void copying();
void reverse();
void vowel();
void quit()
exit(0);
};
void string::read()
cout<<" enter a string ";
gets(str);
void string::display()
cout<<" the string you have entered is "< getch(); } void string::reverse() { int count=0; char temp; for (int i=0;str[i]!= NULL;i++) count++; for(i=0;i<=count/2;i++) { temp=str[i];// reverse 1st string str[i]=str[count-1-i]; str[count-1-i]=temp; i++; } cout<<" reversed "< getch(); } /* void string::capital() { }*/ void string::copying() { char tempstr[100]; int i=0; while(str[i]!=NULL) { tempstr[i]=str[i]; i++; } cout<<" the string copied into a new empty string "< getch(); } void string::vowel() { int count=0; int i=0; while (str[i]!=NULL) { if(str[i]=='a' || str[i]=='e' || str[i]=='i' || str[i]=='o' ||str[i]=='u') { count++; i++; } cout<<" the vowels in lower case "< /* else if(str[i]=='A' || str[i]=='E' || str[i]=='I' || str[i]=='O' || str[i]=='U') { counti++; i++; } cout<<" the vowels in upper case "< } } void main() { int n; string option; do { mainmenu(); cin>>n; switch(n) { case 1:option.read(); break; case 2:option.display(); break; case 3:option.reverse(); break; // case 4:option.capital(); //break; case 5:option.copying(); break; case 6:option.vowel(); break; case 7:exit(0); break; default: cout<<" wrong choice "; } }while(n!='7'); }
getch();
void string::reverse()
int count=0;
char temp;
for (int i=0;str[i]!= NULL;i++)
count++;
for(i=0;i<=count/2;i++)
temp=str[i];// reverse 1st string
str[i]=str[count-1-i];
str[count-1-i]=temp;
i++;
cout<<" reversed "< getch(); } /* void string::capital() { }*/ void string::copying() { char tempstr[100]; int i=0; while(str[i]!=NULL) { tempstr[i]=str[i]; i++; } cout<<" the string copied into a new empty string "< getch(); } void string::vowel() { int count=0; int i=0; while (str[i]!=NULL) { if(str[i]=='a' || str[i]=='e' || str[i]=='i' || str[i]=='o' ||str[i]=='u') { count++; i++; } cout<<" the vowels in lower case "< /* else if(str[i]=='A' || str[i]=='E' || str[i]=='I' || str[i]=='O' || str[i]=='U') { counti++; i++; } cout<<" the vowels in upper case "< } } void main() { int n; string option; do { mainmenu(); cin>>n; switch(n) { case 1:option.read(); break; case 2:option.display(); break; case 3:option.reverse(); break; // case 4:option.capital(); //break; case 5:option.copying(); break; case 6:option.vowel(); break; case 7:exit(0); break; default: cout<<" wrong choice "; } }while(n!='7'); }
/* void string::capital()
}*/
void string::copying()
char tempstr[100];
int i=0;
while(str[i]!=NULL)
tempstr[i]=str[i];
cout<<" the string copied into a new empty string "< getch(); } void string::vowel() { int count=0; int i=0; while (str[i]!=NULL) { if(str[i]=='a' || str[i]=='e' || str[i]=='i' || str[i]=='o' ||str[i]=='u') { count++; i++; } cout<<" the vowels in lower case "< /* else if(str[i]=='A' || str[i]=='E' || str[i]=='I' || str[i]=='O' || str[i]=='U') { counti++; i++; } cout<<" the vowels in upper case "< } } void main() { int n; string option; do { mainmenu(); cin>>n; switch(n) { case 1:option.read(); break; case 2:option.display(); break; case 3:option.reverse(); break; // case 4:option.capital(); //break; case 5:option.copying(); break; case 6:option.vowel(); break; case 7:exit(0); break; default: cout<<" wrong choice "; } }while(n!='7'); }
void string::vowel()
while (str[i]!=NULL)
if(str[i]=='a' || str[i]=='e' || str[i]=='i' || str[i]=='o' ||str[i]=='u')
cout<<" the vowels in lower case "< /* else if(str[i]=='A' || str[i]=='E' || str[i]=='I' || str[i]=='O' || str[i]=='U') { counti++; i++; } cout<<" the vowels in upper case "< } } void main() { int n; string option; do { mainmenu(); cin>>n; switch(n) { case 1:option.read(); break; case 2:option.display(); break; case 3:option.reverse(); break; // case 4:option.capital(); //break; case 5:option.copying(); break; case 6:option.vowel(); break; case 7:exit(0); break; default: cout<<" wrong choice "; } }while(n!='7'); }
/* else
if(str[i]=='A' || str[i]=='E' || str[i]=='I' || str[i]=='O' || str[i]=='U')
counti++;
cout<<" the vowels in upper case "< } } void main() { int n; string option; do { mainmenu(); cin>>n; switch(n) { case 1:option.read(); break; case 2:option.display(); break; case 3:option.reverse(); break; // case 4:option.capital(); //break; case 5:option.copying(); break; case 6:option.vowel(); break; case 7:exit(0); break; default: cout<<" wrong choice "; } }while(n!='7'); }
void main()
int n;
string option;
do
mainmenu();
cin>>n;
switch(n)
case 1:option.read();
break;
case 2:option.display();
case 3:option.reverse();
// case 4:option.capital();
//break;
case 5:option.copying();
case 6:option.vowel();
case 7:exit(0);
default: cout<<" wrong choice ";
}while(n!='7');
wanna c++ program of superpostion of waves
requiredrequiredrequiredrequiredrequiredrequiredrequiredrequired
Tracing of Abstract array: inline int isZero( const Object& o ) { return o == NOOBJECT; } int AbstractArray::isEqual( const Object& obj ) const {
Assume that a Binary Search Tree is constructed by repeatedly inserting exact values in to the tree. Argue that the number of nodes examined in searching for a value in the tree is
limitations of increment operator
Car Rental System This system tracks cars in a rental company. Each car has a number (assume its plate number), type (small car, four wheel car), and status (rented, available). T
Is Overloading of Destructor possible?
Define hash functions. Explain the Division method, Mid square method and Folding method of hash functions.
how to call the value
Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd