1]
Write a Program to delete the lagest word in a string.
Follow the following function prototype.
Void largestword(char *,char *);
void delete(char *);
For example: ABCD PQRSTU 1234
Output : ABCD 1234
2]
Write a Program to reverse the alternate word in a given string.
Follow the following function prototype.
Void revese(char *);
For Example: Abcd 1234 4567 PQRS
Output: dcbA 1234 7654 PQRS
3]
Write a program to delete the words whose length is odd
Follow the following function prototype.
Int length(char *);
void reverse(char *,int);
For Example: Abcd 12347 45678 PQRS9
Output: Abcd 74321 87654 9SRQP
4]
Write a program to replace all occurence of word “Bangalore” by Bengaluru in a string.
Follow the following function prototype.
char * findword(char *);
void replace(char *,int );
5]
Write a program to sort the character in the words of minimum length.
For Example: Input char s[50]=”Abcd had pqrs dba”
Output char s[50]=”Abcd adh pqrs abd”
6]
Given two non-negative integers num1 and num2 represented as strings, return the product of
num1 and num2, also represented as a string.
Int intconvert(char *);
char *Asciiconvert(int *);
For Example: Input char s[50]=”123”
char s1[50]=”123”
Output=”15129”
7]
Reverse the word in a string.
Input char s[50]="the sky is blue"
Output char s[50]="blue is sky the"
8]
Take a float number from user and print that number in string format.
Input float f=12.005;
output Printf(“%s\n”,a); ---------12.005
where a is character array.
Follow the following function prototype.
Char * floattoascii(char *,float);
9]
Take one string from user.
For example char s[]=”ABCDE”;
Write a program such that it will print following output.
A
BA
CBA
DCBA
EDCBA
DCBA
CBA
BA
A
Write a generic program.
Take input as any string it should work for it.
Follow the following function prototype.
Void fun(char *);
10]
Take one array and replace each element of the array by count and that count should represent how
many prime number are there before that cooresponding element.
For example
Input int a[5]={10,20,30,40,50};
Output a[5]={4,8,10,12,15}
where 4 is number of prime number before 10 and so on.
Follow the following function prototype.
Void prime(int *,int);
void prime count (int ,int*);