Question

I need this in C not C++ just C

SET-151 C Programming #1

Homework: 7 String Basics – Death by a thousand strings.

                                                                                                                                                                       

Reading(s): Chapter(s) in C Primer Plus 1-7, 9, 10

please use this format

// ------------------------------------------------------------------------------------------
// Name: Your name here
// Class: C Programming
// Abstract: Homework 1.
// ------------------------------------------------------------------------------------------

// ------------------------------------------------------------------------------------------
// Includes
// ------------------------------------------------------------------------------------------
#include<stdio.h>
#include<stdlib.h>

// ------------------------------------------------------------------------------------------
// Constants
// ------------------------------------------------------------------------------------------

// ------------------------------------------------------------------------------------------
// Prototypes
// ------------------------------------------------------------------------------------------

// ------------------------------------------------------------------------------------------
// Name: main
// Abstract: This is where the program starts
// ------------------------------------------------------------------------------------------
void main( )
{

}

YOU CAN'T USE ANY BUILT-IN STRING FUNCTIONS.

Write a function that takes strSource as a parameter. The function will return the length of the string.

Write a subroutine that takes strDestination and strSource as parameters. The subroutine will copy the source string to the destination string.

Write a function that takes strSource and chrLetterToFind as parameters. The function will return the index of the first occurrence of the letter (case sensitive) in the string searching from left to right. Return –1 if the letter is not in the string.

Write a function that takes strSource and chrLetterToFind as parameters. The function will return the index of the first occurrence of the letter (case INsensitive) in the string searching from left to right. Return –1 if the letter is not in the string. Do NOT change the source string.

Write a subroutine that takes strDestination and strSource as parameters. The subroutine will append the source string to the end of the destination string. Assume the destination string is large enough to hold all the characters.

Write a subroutine that takes strDestination and strSource as parameters. The subroutine will copy the source string to the destination string in reverse order. Do NOT change the source string.

Write a subroutine that takes strDestination and strSource as parameters. The subroutine will copy the source string to the destination string and make the destination string all uppercase. Do NOT change the source string.

Write a subroutine that takes strDestination, strSource, intStartIndex and intLength as parameters. The subroutine will copy a substring from the source string to the destination string starting at intStartIndex and of length intLength. Do NOT change the source string.

Write a function that takes strSource as a parameter. The function will return the number of words in the string. For example the sentence “Mary had a little lamb.” has 5 words. Counting words is not the same thing as counting spaces. Do NOT change the source string.

Call each of the above functions from your main subroutine and display the results. For example:

void main( )

{

            char strSource[ 50 ] = "I Love Star Trek";

            int intLength = 0;

            char strDestination[ 50 ] = "";

            // Problem #1: String length

            intLength = StringLength( "I Love Star Trek" );

            printf( "Problem #1: String Length: %d\n", intLength );

            printf( "\n" );

            // Problem #2: CopyString

            CopyString( strDestination, "I Love Star Trek" );

            printf( "Problem #2: CopyString: %s\n", strDestination );

            printf( "\n" );

            etc

}

Answer 1

Code:

#include<stdio.h>
#include<malloc.h>

//Problem #1
int length_of_string(char *strSource)
{
    int i, len = 0;
    for(i = 0; strSource[i] != '\0'; i++)//iterate until find end of string \0
    {
        len++;//increment the length.
    }
    return len;
}

//Problem #2
void copy_string(char *strSource, char *strDestination)
{
    int i;
    for(i=0; strSource[i] != '\0'; i++ )//iterate until find end of string \0
    {
        strDestination[i] = strSource[i];//Copy
    }
    strDestination[i] = '\0';//Add \0 to indicate end of string.
    printf("\nProblem #2: After copy the destination string = %s", strDestination);
}

//Problem #3
int letter_to_find(char *strSource, char chrLetterToFind)
{
    int i;
    //If chrLetterToFind is uppercase, make it lowercase.
    if(chrLetterToFind >= 65 && chrLetterToFind <= 90)
        chrLetterToFind = chrLetterToFind + 32;
    for(i=0; strSource[i] != '\0'; i++)
    {
        //If character in the source string is lowercase
        if(strSource[i] >=97 && strSource[i] <= 122)
        {
            if(strSource[i] == chrLetterToFind)//Check for the match.
                return i;//Return the index.
        }
        else{
            if(strSource[i] + 32 == chrLetterToFind)//If the character in the source string is uppercase make
                //it lowercase and then check for the match.
                return i;
        }
    }
    return -1;
}

//Problem #4
void append_source(char *strSource, char *strDestination)
{
    int i , j;
    i = length_of_string(strDestination);//length of the string.
    for(j = 0; strSource[j] != '\0'; j++)
    {

        strDestination[i] = strSource[j];//add characters at the end.

        i++;
    }
    strDestination[i]= '\0';
    printf("\nProblem #4: After appending the content of destination string: %s", strDestination);

}

//Problem #5
void copy_reverse_order(char *strSource, char *strDestination)
{
    int i = length_of_string(strSource);
    int j, k;
    for(j = i-1, k = 0; j != 0; j--, k++)//Iterate from the last of the source.
    {
        strDestination[k] = strSource[j];
    }
    strDestination[k] = strSource[0];
    strDestination[++k] = '\0';
    printf("\nProblem #5: Copy in reverse order: %s", strDestination);
}

//Problem #6
void uppercase_string(char *strSource, char *strDestination)
{
    int i;
    for(i = 0; strSource[i] != '\0'; i++)
    {
        if(strSource[i] >= 97 && strSource[i]<= 122)//If lowercase
        {
            strDestination[i] = strSource[i] - 32;//Convert to uppercase.
        }

        else{//Do nothing just copy.
            strDestination[i] = strSource[i];
        }
    }
    strDestination[i] = '\0';
    printf("\nProblem #6: String in Uppercase: %s", strDestination);
}

//Problem #7
void copy_upto_length(char *strSource, char *strDestination, int StartIndex, int Length)
{
    int i, j;
    for(j = 0, i = StartIndex; i != Length; i++, j++)
    {
        strDestination[j] = strSource[i];
    }
    strDestination[j] = strSource[i];
    strDestination[++j] = '\0';
    printf("\nProblem #7: Copy upto the length: %s", strDestination);
}

//Problem #8
int number_of_words(char *strSource)
{
    int i, word = 0;
    for(i = 0; strSource[i] != '\0'; i++)
    {
        if(strSource[i] == 32 || strSource[i] == '.')
            word++;
    }
    return word;
}
int main()
{
    char *myString = "Mary had a little lamb.";
    char *str1 = (char *)malloc(sizeof(myString));//Allocate memory.
    int l = length_of_string(myString);
    printf("\nProblem #1: String Length = %d", l);

    copy_string(myString, str1);

    int index = letter_to_find(myString, 'm');
    printf("\nProblem #3:Index is = %d", index);

    char str2[50] = "This is another string";
    append_source(myString, str2);

    char str5[50];
    copy_reverse_order(myString, str5);

    char str3[20];
    copy_upto_length(myString, str3, 5, 10);

    char str4[20];
    uppercase_string(myString, str4);

    int word = number_of_words(myString);
    printf("\nProblem #8: Number of words = %d", word);
    return 0;
}

Output:

Problem #1: String Length 23 Problem #2 :. After copy the destination string -Mary had a little ianb. Problem #3: Index is Problem #4: After appending the content of destination string: This is another s tringMary had a little lamb Problem #5: Copy in reverse order: _hmal elttil a dah yraM Problem #6 : String in Uppercase: MARY HAD A LITTLE LAMB. Problem #8: Number of words = 5 Process returned 0 〈0x0〉 execution time : 0.016 s Press any key to continue