For this project, you will write a C++ program with the following 4 functions: 1

Question

 For this project, you will write a C++ program with the following 4 functions:  1. Write a function with the following description.   /* * This function inspects the characters in the given array charArray * and returns true, iff the array contains a palindrome. * A palindrome is a sequnece of characters that reads the same * forward or backward: e.g. * {'m','o','m'} * {'e','y','e'}  * {'r','a','c','e','c','a','r'}  */  bool isPalindrome(char charArray[], int arraySize);   2. Write a function with the following description.   /* * This function inspects the characters in the given array charArray * and counts the number of times targetChar occurs. * so for e.g. for the input array {'e','y','e'} and targetChar 'e', * this function should return 2, but for targetChar 'x', this function should return 0. */  int countHowMany(char charArray[], int arraySize, char targetChar);  3. Write a function with the following description.  /* * This function inspects the characters in the given array charArray and  * returns the character that has the highest number of occurrences. *  * for e.g. for the input array {'e','y','e'}, the function returns 'e' * * for e.g. for the input array {'m','i','s','s','i','s','s','i','p','i'},  *    the function returns 's' * * for input array {'c','a','r'}, the function is allowed to return any  *    arbitrary character within the array (e.g. 'c') * * You can assume that charArray[] contains only characters a-z and/or A-Z * */ char getMostFrequentChar(char charArray[], int arraySize);   4. Write another version of the above function that is able to ignore non-alphabetic characters from the array, but otherwise still functions the same way.  /* * for the input array {'e', '1', '@', 'y','e', '1', 'Y'}, the function returns 'e' * (y and Y  are both alpha, but considered separately) */ char getMostFrequentAlphaChar(char array[], int arraySize);  Your main function should provide evidence of adequate testing performed for each of your functions. 

Explanation / Answer

Hi Friend,

I have answered Q1 and Q2.

Please repost others in separate post.

Write a function with the following description. /* * This function inspects the characters in the given array charArray * and returns true, iff the array contains a palindrome. * A palindrome is a sequnece of characters that reads the same * forward or backward: e.g. * {'m','o','m'} * {'e','y','e'} * {'r','a','c','e','c','a','r'} */

bool isPalindrome(char charArray[], int arraySize) {

    int i = 0;
    int j = arraySize-1;

    while(i < j) {
        if(charArray[i] != charArray[j])
            return false;
        i++;
        j--;
    }

    return true;
}

2. Write a function with the following description. /* * This function inspects the characters in the given array charArray * and counts the number of times targetChar occurs. * so for e.g. for the input array {'e','y','e'} and targetChar 'e', * this function should return 2, but for targetChar 'x', this function should return 0. */

int countHowMany(char charArray[], int arraySize, char targetChar) {

    int count = 0;

    for(int i=0; i<arraySize; i++) {
        if(charArray[i] == targetChar)
            count++;
    }

    return count;
}

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.