Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Sheru Ap 1.3

    Uploaded by

    Utkarsh Rastogi
    The document describes an experiment to find the minimum number of deletions required to remove all adjacent matching characters in a string. It provides the aim, algorithm/flowchart, code, and output of the experiment. The algorithm iterates through the string, counts each instance where adjacent characters match, and returns the count as the minimum number of required deletions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Sheru Ap 1.3

    Uploaded by

    Utkarsh Rastogi
    7 views2 pages
    The document describes an experiment to find the minimum number of deletions required to remove all adjacent matching characters in a string. It provides the aim, algorithm/flowchart, code, and output of the experiment. The algorithm iterates through the string, counts each instance where adjacent characters match, and returns the count as the minimum number of required deletions.

    Original Description:

    Original Title

    SHERU AP 1.3

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes an experiment to find the minimum number of deletions required to remove all adjacent matching characters in a string. It provides the aim, algorithm/flowchart, code, and output of the experiment. The algorithm iterates through the string, counts each instance where adjacent characters match, and returns the count as the minimum number of required deletions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    7 views2 pages

    Sheru Ap 1.3

    Uploaded by

    Utkarsh Rastogi
    The document describes an experiment to find the minimum number of deletions required to remove all adjacent matching characters in a string. It provides the aim, algorithm/flowchart, code, and output of the experiment. The algorithm iterates through the string, counts each instance where adjacent characters match, and returns the count as the minimum number of required deletions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    EXPERIMENT 1.

    NAME: SHREYANSH RAJ

    UID: 20BCG1103

    CLASS: 20BCG1 SECTION: B

    DATE OF PERFORMANCE: 05/09/2022

    1. AIM: You are given a string containing characters A and B only. Your task is to change it into a
    string such that there are no matching adjacent characters. To do this, you are allowed to delete
    zero or more characters in the string. Your task is to find the minimum number of required
    deletions.

    2. Algorithm/Flowchart:

    Step.1:- Take input of the string.

    Step.2:- Iterate through the string if you find s[i]==s[i+1] we increase the

    value of count by 1 .

    Step.3:- Return the value of count .


    3. Code:

    #include <iostream>

    #include<bits/stdc++.h>

    using namespace std;

    int main()

    string s="ABBABBA";

    int count=0;

    for(int i=0;i<s.size()-1;i++)

    if(s[i]==s[i+1]) count++;

    cout<<" The minimum number of Delete Operations:-"; cout<<count;

    4. Output

    You might also like