Write C++ program for string operations- copy, concatenate, check substring, equal, reverse and length

Second Year Computer Engineering Data Structure Programs:

Data Structure Lab:

Practical 2:
Write C++ program for string operations- copy, concatenate, check substring, equal, reverse and length.

#include<iostream>
#include<string>
using namespace std;
class str
{
    string a,b,c,r,s1,s2,s3,ss;
    int i,ct,n,j,len,k;
    public:
    void length()
    { cout<<"\n\n...Length of string...\n\n";
        ct=0;
        cout<<"ENter string=\n";

        cin>>a;
        for(i=0;a[i]!='\0';i++)
            {
                ct++;
            }
        cout<<"Length of string=\t"<<ct;
    }
    void concat()
    { cout<<"\n\n...ConCatination Operation...\n\n";

        cout<<"\nEnter string 1=\t";
        cin>>b;
        cout<<"\nEnter string 2=\t";
        cin>>c;
        cout<<"\nYour entered strings are=\n"<<b<<"\n"<<c;
        n=0;
        for(i=0;b[i]!='\0';i++)
        {
            r[n]=b[i];
            n++;
        }
        for(j=0;c[j]!='\0';++j)
        {
            r[n]=c[j];
            n++;
        }
        cout<<"\nResultant string=\t\t";//<<r;
        for(i=0;r[i]!='\0';i++)
        {
                    cout<<r[i];
        }
    }
    void  copy()
    {
        cout<<"\n\n***---Copy operation---***\n\n";
        cout<<"\nEnter string=\t";
        cin>>s1;
        ct=0;
        for(i=0;s1[i]!='\0';i++)
            {
                ct++;
            }

        for(i=0;i<ct;i++)
                    {
                        s2[i]=s1[i];
                    }
            cout<<"\nCopied string=\t";

            cout<<s2;
    }
    void rev()
    {
        cout<<"***---Reverse Operation---***";
        cout<<"\n\nEnter string=";
        cin>>s3;
        ct=0,k=0;
        for(i=0;s3[i]!='\0';i++)
        {
                        ct++;
        }
        for(i=ct-1;i>=0;i--,k++)
        {
            ss[k]=s3[i];
        }
        cout<<"\n reversed=";

        for(i=0;i<k;i++)
        cout<<ss[i];
    }
    void eq()
    { cout<<"***---Comparing  Operation---***";
        cout<<"\nEnter string 1=";
        cin>>s1;
        cout<<"\nEnter string 2=";
        cin>>s2;
        if(s1==s2)
        {
            cout<<"\nString are SAme..!!";
        }
        else
        {
            cout<<"\nSrting are NOT same..!!";
        }

    }
    void sub()
    {
        cout<<"\n***---Substring  Operation---***";
        cout<<"\n\nEnter string=";
        cin>>a;
        int m=0;
        cout<<"\nEnter a string=";
        cin>>b;
        for(i=0;a[i]!=NULL;i++)
        {
        if(a[i]==b[0])
        {
        for(j=1;b[j]!=NULL;j++)
        {
        if(a[i+j]!=b[j])
        {
        break;
        }
        }
        if(b[j]==NULL)
        {
        i=i+j-1;
        m++;
        }
        }
        }
        if(m==0)
        {
        cout<<"\nSubstring not present\n";
        }
        else
        {
        cout<<"\t"<<b<<" is repeated "<<m<<" times";
        }
        }
};
   int main()
{
    str s;
    char ans;
    int ch;
    do

    {
        cout<<"\t\tMEnu\n\n";
        cout<<"1)Length\n2)ConCatination\n3)reverse\n4)equality\n5)substring\n6)copy\n\nenter your choice (1-6)=\t";
        cin>>ch;
        switch(ch)
        {
            case 1 :s.length(); break;
            case 2 :s.concat(); break;
            case 3 :s.rev(); break;
            case 4 :s.eq(); break;
            case 5 :s.sub(); break;
            case 6 :s.copy(); break;
            default:cout<<"\n wrong selection..!!\n";
        }
    cout<<"\n\n want try more operation(Y/N)=";
    cin>>ans;
    }while(ans=='Y'||ans=='y');
    return 0;
}

----------------------------------------------------------------------------------------------------------------------------------
   /*
MEnu

1)Length
2)ConCatination
3)reverse
4)equality
5)substring
6)copy

enter your choice (1-6)= 1


...Length of string...

ENter string=
mescoe
Length of string= 6

want try more operation(Y/N)=y
MEnu

1)Length
2)ConCatination
3)reverse
4)equality
5)substring
6)copy

enter your choice (1-6)= 2


...ConCatination Operation...


Enter string 1= mescoe

Enter string 2= pune

Your entered strings are=
mescoe
pune
Resultant string= mescoepune

want try more operation(Y/N)=y
MEnu

1)Length
2)ConCatination
3)reverse
4)equality
5)substring
6)copy

enter your choice (1-6)= 3
***---Reverse Operation---***

Enter string=mescoe

reversed=eocsem

want try more operation(Y/N)=y
MEnu

1)Length
2)ConCatination
3)reverse
4)equality
5)substring
6)copy

enter your choice (1-6)= 4
***---Comparing  Operation---***
Enter string 1=mescoe

Enter string 2=mescoe

String are SAme..!!

want try more operation(Y/N)=y
MEnu

1)Length
2)ConCatination
3)reverse
4)equality
5)substring
6)copy

enter your choice (1-6)= 5

***---Substring  Operation---***

Enter string=mescoe

Enter a string=lko

Substring not present


want try more operation(Y/N)=y
MEnu

1)Length
2)ConCatination
3)reverse
4)equality
5)substring
6)copy

enter your choice (1-6)= 5

***---Substring  Operation---***

Enter string=mescoe

Enter a string=me
me is repeated 1 times

want try more operation(Y/N)=y
MEnu

1)Length
2)ConCatination
3)reverse
4)equality
5)substring
6)copy

enter your choice (1-6)= 6


***---Copy operation---***


Enter string= mescoe

Copied string= mescoe

want try more operation(Y/N)=n
/*

Comments

Post a Comment

Popular posts from this blog

Implement C++ program for expression conversion as infix to postfix and its evaluation using stack.

Second Year Computer Engineering Data Structure Programs: Data Structure Lab: Practical C25: Implement C++ program for expression conversion as infix to postfix and its evaluation using stack based on given conditions i. Operands and operator, both must be single character. ii. Input Postfix expression must be in a desired format. iii. Only '+', '-', '*' and '/ ' operators are expected. ---------------------------------------------------------------------------------------------------------------------------------- #include<iostream> #include<conio.h> using namespace std; class stack {  public:   char stack_array[50];   int top;   stack()   {     top=-1;   } void push(char symbol) {  if(full())       cout<<"\nStack overflow:\n";     else     { top=top+1;       stack_array[top]=symbol;      } } char pop() {   if(empty())        return('#');         // Return value '#' indica
Read more

Write C++ program to maintain club member‘s information using singly linked list. Store student PRN and Name.

Second Year Computer Engineering Data Structure Programs: Data Structure Lab: Practical B14: Department of Computer Engineering has student's club named 'Pinnacle Club'. Students of Second, third and final year of department can be granted membership on request. Similarly one may cancel the membership of club. First node is reserved for president of club and last node is reserved for secretary of club. Write C++ program to maintain club member‘s information using singly linked list. Store student PRN and Name. Write functions to a) Add and delete the members as well as president or even secretary. b) Compute total number of members of club c) Display members d) Display list in reverse order using recursion e) Two linked lists exists for two divisions. Concatenate two lists. ------------------------------------------------------------------------------------------------------------------------------- #include <iostream> #include <string.h> usin
Read more

Write C++/Java program for line drawing using DDA or Bresenhams algorithm with patterns such as solid, dotted, dashed, dash dot and thick.

Second Year Computer Engineering Computer Graphics Programs: Computer Graphics Lab: Practical B10: Write C++/Java program for line drawing using DDA or Bresenhams algorithm with patterns such as solid, dotted, dashed, dash dot and thick. ---------------------------------------------------------------------------------------------------------------------------------- #include <iostream> #include <stdlib.h> #include <graphics.h> #include <math.h> using namespace std; int xmax,ymax,xmid,ymid; class Line { public: int x1,x2,y1,y2,ch;        void bss(int x1,int y1,int x2,int y2)           {             int dx,dy,x,y,s1,s2,ex,e,i,flag=0,temp;                         dx=abs(x2-x1);             dy=abs(y2-y1);             x=x1;             y=y1;             putpixel(x+xmid,ymid-y,15);                  if(x2>x1)              { s1=1;           }              if(x2==x1)              { s1=0;     }              if(x2
Read more