STRING FUNCTION USING C



To write a c program to manipulate the string following the operations.
i.                    Concatenating two string
ii.                  Reversing the string
iii.                Finding substring
iv.                Replace the string
v.                  Finding the length of string.

            /*STRING FUNCTION */
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
void main()
{
int ch;
void concat();
void rever();
void len();
void replc();
void substr();
clrscr();
printf("\n\n\tSTRING OPERATIONS");;
printf("\n\t********************\n");
do
{
printf("\n\t1.CONCATINATION\n\t2.REVERSE\n\t3.LENGHT\n\t4.REPLACE\n”);printf(“\t5.SUBSTRING");
printf("\n\t6.EXIT");
printf("\nEnter your choice:");
scanf("%d",&ch);
switch(ch)
{
case 1:
concat();
break;
case 2:
rever();
break;
case 3:
len();   
break; 
case 4:
replc();
break;
case 5:
substr();
break;
case 6:
exit(0);
break;

default:
printf("\n\tInvaid choice");
}
}
while(ch!=6);
getch();
}

void concat()
{
int i=0,j=0;
char s1[30],s2[30];
printf("\nEnter string1:");
scanf("%s",s1);
printf("\nEnter string2:");
scanf("%s",s2);
while(s 1[i]!='\0')
i++;
while(s 2[j]!='\0')
s1[i++]=s2[j++];
s1[i]='\0';
printf("\nThe concate string:%s",s1);
getch();
}

void rever()
{
char s[30];      
int i=0,j;
printf("\nEnter the string:");   
scanf("%s",s);
while(s[i]!='\0')
i++;
printf("\nThe reverse string is:");
for(j=i;j>=0;j--)
printf("%c",s[j]);
getch();
}

void len()
{
char s[30];
int i=0;
printf("\nEnter the string:");
scanf("%s",s);
while(s[i]!='\0')
i=i+1;
printf("\nThe length of string is:%d",i);
getch();
}

void replc()
{
            int i,pos;
char s1[30],s2[30];
printf("\nEnter the string1:");
scanf("%s",s1);
printf("\nThe replacement string: ");
scanf("%s",s2);
printf("\nThe replace position:");
scanf("%d",&pos);
pos=pos-1;
i=0;
while(s1[i]!='\0')
s1[pos++]=s2[i++];
printf("\nThe result after replacement:%s",s1);
getch();
}

void substr()
{
int i,k,c;
char s1[30];
printf("\nString1:");
scanf("%s",s1);
printf("\nThe starting index:");
scanf("%d",&i);
printf("\nEnter the number of character:");
scanf("%d",&c);
printf("The substring is:");
for(k=i;k<c+i-1;k++)
printf("%c",s1[k]);      
getch();
}

 
OUTPUT:     
        STRING OPERATIONS
        ********************
        1.CONCATINATION
        2.REVERSE
        3.LENGHT
        4.REPLACE
        5.SUBSTRING
        6.EXIT
Enter your choice: 1
Enter string1: vivek
Enter string2: anand
The concate string: vivekanand

        1.CONCATINATION
        2.REVERSE
        3.LENGHT
        4.REPLACE
        5.SUBSTRING
        6.EXIT
Enter your choice: 2
Enter the string: dog
The reverse string is: god




        1.CONCATINATION
        2.REVERSE
        3.LENGHT
        4.REPLACE
        5.SUBSTRING
        6.EXIT
Enter your choice: 3
Enter the string: vivekananthan
The length of string is: 13

        1.CONCATINATION
        2.REVERSE
        3.LENGHT
        4.REPLACE
        5.SUBSTRING
        6.EXIT
Enter your choice: 4
Enter the string1: vivek
The replacement string: i
The replace position: 2
The result after replacement: vi






        1.CONCATINATION
        2.REVERSE
        3.LENGHT
        4.REPLACE
        5.SUBSTRING
        6.EXIT
Enter your choice: 5
String1: vivek
The starting index: 2
Enter the number of character: 3
The substring is: ve

        1.CONCATINATION
        2.REVERSE
        3.LENGHT
        4.REPLACE
        5.SUBSTRING
        6.EXIT
Enter your choice: 6




Comments

Post a Comment

Popular posts from this blog

TRAVELING SALESMAN USING BRANCH AND BOUND TECHNIQUE

Image
The Traveling Salesman Problem (TSP) is a classic problem in computer science and optimization theory. The problem is defined as follows: given a set of cities and the distances between them, find the shortest possible path that visits each city exactly once and returns to the starting city. The Branch and Bound technique is an algorithmic paradigm for solving combinatorial optimization problems. The basic idea is to explore the search space by dividing it into smaller subproblems, and then pruning branches of the search tree that can be shown to lead to suboptimal solutions. The branch and bound algorithm for the TSP works by starting with an initial lower bound on the length of the optimal tour, and then exploring the search space by systematically building up partial tours and computing lower bounds on their completion. Sample C code for solving the Traveling Salesman Problem(TSP) using the branch and bound technique: #include <stdio.h> #include <stdlib.h> #include ...
Read more

OPERATING SYSTM’s ALGORITHM (In LINUX OS) - FIRST FIT, BEST FIT, WORST FIT ALGORITHM

FIRST FIT, BEST FIT, WORST FIT ALGORITHM PROGRAM: #include<stdio.h> int mem[20],proc[20],bp[20],bm[20],cm[20],cp[20],ms,ps,i,j,ch,y; main() {             printf(“\nEnter the number of memory segments”);             scanf(“%d”,&ms);             printf(“\nEnter the memory segment”);             for(i=0;i<ms;i++)             {                         scanf(“%d”,&mem[i]);                         bm[...
Read more

OPERATING SYSTM’s ALGORITHM (In LINUX OS) - BANKERS ALGORITHM

BANKERS ALGORITHM – SINGLE RESOURCES PROGRAM: #include<stdio.h> main() { int j=0,cmp=0,i,tot,avail,need[20],n,tr,max[20],hold[20]; printf("Enter the number of process"); scanf("%d",&n); printf("Enter the number of resources"); scanf("%d",&tr); printf("Enter the max,need,hold for each process"); for(i=0;i<n;i++) { printf("p%d",i); scanf("%d",&max[i]); scanf("%d",&hold[i]); } tot=0; for(i=0;i<n;i++) { tot=tot+hold[i]; need[i]=max[i]-hold[i]; } avail=tr-tot; while(j!=tr) { for(i=0;i<n;i++) { if(need[i]!=0&&need[i]<=avail) { avail=avail+hold[i]; need[i]=0; printf("%d\t%d\n",i,avail); cmp++; } } j++; } if(avail==tr) printf("safe state"); else printf("unsafe state"); }
Read more