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!
C Program for REVERSE THE WORD IN STRING
#include conio.h>
#include stdio.h>
#include string.h>
void main()
{
char a[50],b[25][25],temp;
int i=0,j=0,k=0,l[25],c=0,c1=0,t=0;
clrscr();
for(i=0;i<25;i++)
for(j=0;j<25;j++)
l[i]=0;
b[i][j]=0;
}
i=0;
j=0;
printf("ENTER THE STRING: ");
do
a[i++]=getchar();
}while(a[i-1]!='\n');
a[i]='\0';
for(i=0;a[i]!=0;i++)
if(a[i]!=' ' && a[i]!='\n')
l[c]=l[c]+1;
b[c][c1++]=a[i];
else
c++;
c1=0;
c=0;
for(i=0;l[i]!=0;i++)
for(j=0;b[i][j]!=0;j++)
if(b[i][j]=='A' || b[i][j]=='a' || b[i][j]=='E' || b[i][j]=='e' || b[i][j]=='I' || b[i][j]=='i' || b[i][j]=='O' || b[i][j]=='o' || b[i][j]=='U' || b[i][j]=='u')
c=1;
if(c==1)
c1=l[i];
c1--;
t=l[i];
t=t/2;
for(k=0;k { temp=b[i][k]; b[i][k]=b[i][c1]; b[i][c1]=temp; c1--; } c=0; } } for(i=0;l[i]!=0;i++) { printf("%s ",b[i]); } getch(); } OUTPUT : ENTER THE STRING: KAMLESH D MENGAR HSELMAK D RAGNEM
temp=b[i][k];
b[i][k]=b[i][c1];
b[i][c1]=temp;
printf("%s ",b[i]);
getch();
OUTPUT :
ENTER THE STRING: KAMLESH D MENGAR
HSELMAK D RAGNEM
lcm program.
HWID Spoofer for Windows 7, 8 x64 Project Description: I want a simple program that will spoof my hardware id. I should be able to prepare the id to spoof to in the program a
Various ways of initializing the Arrays. - The for loop initializes 10 elements with the value of their index. void main() { const in
smugglers transfer
Write a c program to determine interchanged values between two variables?[Hint - if loop] What will be the output of the program? How many times this loop will execute? Wr
What is memory allocation? Memory Allocation : It is the method of allocating memory storage to program in such that the program can be run.
countSpaceAvailbility function that counts and returns the space availability in the circle queue there are two elemnts at the circle queue and should return 5 space if size 7 .
implement two stacks in one array A[1...n] in such a way that neither stack overflows unless the total number of elements in both stacks together is n. For this you need to produce
I want a Reverse engineer a .exe to obtain the code Project Description: I'd like to get the full C++ source code from a .exe please Skills required is C++ Programming
Many modern cryptography algorithms require two numbers that are coprime, or sometimes referred to as relatively prime. Two numbers are coprime if their greatest common divisor is
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd