#include<stdio.h>
int main(){
char str[100];
int l= 0;
gets(str);
while(str[l]!='\0')
l++;
scanf("\n");
return 0;
EX3 :
#include<stdio.h>
int main(){
char str[100];
int l= 0;
while(str[l]!='\0')
l++;
scanf("\n");
return 0;
EX4
#include <stdio.h>
int main(){
char str1[100],str2[100];
int flg=0,i=0;;
scanf("%s",str1);
scanf("%s",str2);
while(str1[i] == str2[i]){
break;
i++;
flg=0;
flg=-1;
if(flg == 0){
else{
return 0;
#include<stdio.h>
while(chaine1[i] == chaine2[i])
break;
i++;
flg=0;
else if(chaine1[i] > chaine2[i])
flg=1;
flg=-1 ;
return flg ;
int main(){
if(res == 0)
printf("\nThe length of both strings are equal and \nalso both strings are equal.\n\n");
else
scanf("\n");
return 0; }
EX5 :
#include <stdio.h>
int main()
int i;
gets(str1);
i=0;
while(str1[i]!='\0')
str2[i] = str1[i];
i++;
str2[i] = '\0';
scanf("\n");
return 0;
EX6 :
#include <stdio.h>
#include <string.h>
int main(){
char str[100];
gets(str);
vowel = 0;
cons = 0;
len = strlen(str);
vowel++;
cons++;
scanf("\n");
return 0;
EX7 :
#include<stdio.h>
#include<string.h>
int main()
char str[100],ch;
int i,j,l;
gets(str);
l=strlen(str);
if(str[j] <str[i])
ch = str[i];
str[i] = str[j];
str[j] = ch;
printf("%s\n",str);
scanf("\n");
return 0;
#include<stdio.h>
// question 1
while(chaine1[i] == chaine2[i])
break;
i++;
flg=0;
flg=1;
flg=-1 ;
return flg ;
// question 2
char *tmp ;
if (compareTo(tab[j],tab[j+1]) == 1)
tmp = tab[j];
tab[j] = tab[j+1];
tab[j+1] = tmp;
return tab ;
int main(){
trier(tab,3);
scanf("\n");
return 0;
Ex8 :
#include <stdio.h>
int main() {
int pos, l, c = 0;
gets(str);
scanf("%d", &pos);
scanf("%d", &l);
sstr[c] = str[pos+c-1];
c++;
sstr[c] = '\0';
scanf("\n");
return 0;
EX9 :
#include <stdio.h>
#include <string.h>
#include <ctype.h>
int main()
char str[100];
int ctr;
char ch;
gets(str);
ctr=strlen(str);
putchar(ch);
scanf("\n");
return 0;
EX10 :
#include <stdio.h>
#include <string.h>
void changePosition(char *ch1, char *ch2){
char tmp;
tmp = *ch1;
*ch1 = *ch2;
*ch2 = tmp;
int i;
if (stno == endno)
else{
changePosition((cht+stno), (cht+i));
changePosition((cht+stno), (cht+i));
int main()
int n = strlen(str);
charPermu(str, 0, n-1);
scanf("\n");
return 0;
EX11 :
#include <stdio.h>
#include <string.h>
if (chaine[index] == chaine[len_index])
return;
else
int main()
{
char chaine[25];
scanf("%s", chaine);
TestPalindrome(chaine, 0);
scanf("\n");
return 0;
EX12 :
#include <stdio.h>
int main()
char alph[27];
int i;
char *ptr;
ptr = alph;
for(i=0;i<26;i++) {
*(ptr+i)='A'+i;
ptr++;
}
ptr = alph;
for(i=0;i<26;i++)
ptr++;
scanf("\n");
return(0);