Coding Practice — How to Think Like a Computer Scientist

How much does Bubba love shrimp? Probably a lot. But how many times does the word “shrimp” come up in his monologue? Write a function countWord that counts the number of times a given word appears in a given string. countWord should take two strings input and word as parameters and return an int. Feel free to use the stringToLower function we wrote earlier. Select the Parsonsprob tab for hints for the construction of the code.

How much does Bubba love shrimp? Probably a lot. But how many times does the word “shrimp” come up in his monologue? Write a function countWord that counts the number of times a given word appears in a given string. countWord should take two strings input and word as parameters and return an int. Feel free to use the stringToLower function we wrote earlier. Use the lines to construct the code, then go back to complete the Activecode tab.

        int countWord (string input, string word) {
---
    int count = 0;
---
    for (size_t i = 0; i < input.length() - 1; i++) {
        size_t j = 0;
        size_t k = i;
---
    for (int i = 0; i < input.length(); i++) { #paired
        size_t j = 0;
        size_t k = i;
---
        for (size_t l = 0; l < word.length(); l++) {
---
            if (input[k] == word[l]) {
                j++;
            }
            k++;
---
            if (j == word.length()) {
                count++;
            }
---
        }
    }
    return count;
}

Write a void function removeWord that removes a given word from a given string and prints out the new string. removeWord should take two strings input and word as parameters and prints out input with every occurence of word removed. Use string concatenation and the C++ string function substr. substr takes two parameters, a starting index and a length. For example, if string greeting = "hello world", then greeting.substr(6, 5) returns the string "world". Test your function in main. Select the Parsonsprob tab for hints for the construction of the code. The output should be:

Gucci , Gucci , Gucci , Gucci

Write a void function removeWord that removes a given word from a given string and prints out the new string. removeWord should take two strings input and word as parameters and prints out input with every occurence of word removed. Use string concatenation and the C++ string function substr. substr takes two parameters, a starting index and a length. For example, if string greeting = "hello world", then greeting.substr(6, 5) returns the string "world". Test your function in main. Use the lines to construct the code, then go back to complete the Activecode tab. The output should be:

Gucci , Gucci , Gucci , Gucci

        void removeWord (string input, string word) {
---
    for (size_t i = 0; i < word.length(); i++) {
---
    for (size_t i = 0; i < input.length(); i++) { #paired
---
        size_t pos = input.find(word);
---
        if (pos != string::npos) {
---
        if (pos != input.length()) { #paired
---
            input.erase(pos, word.length());
---
        }
    }
    cout << input;
}

Write the function reverseString which takes a string input, reverses it, and returns the reversed string. Run and test your code! Select the Parsonsprob tab for hints for the construction of the code.

Write the function reverseString which takes a string input, reverses it, and returns the reversed string. Use the lines to construct the code, then go back to complete the Activecode tab.

        string reverseWord (string input) {
---
    size_t len = input.length();
---
    string reverse;
---
    for (size_t i = len - 1; i >= 0; i--) {
---
    for (size_t i = len; i >= 0; i--) { #paired
---
        reverse.push_back(input[i]);
---
    }
---
    return reverse;
}

Write the function countVowels which takes a string input and returns the number of vowels in the string. Remember, ‘a’, ‘e’, ‘i’, ‘o’, and ‘u’ are vowels. Run and test your code! Select the Parsonsprob tab for hints for the construction of the code.

Write the function countVowels which takes a string input and returns the number of vowels in the string. Remember, ‘a’, ‘e’, ‘i’, ‘o’, and ‘u’ are vowels. Use the lines to construct the code, then go back to complete the Activecode tab.

        int countVowels (string input) {
---
    int count = 0;
---
    for (size_t i = 0; i < input.length; i++) {
---
        if (input[i] == 'a' || input[i] == 'e' || input[i] == 'i' || input[i] == 'o' || input[i] == 'u') {
---
        if (input[i] == 'a' && input[i] == 'e' && input[i] == 'i' && input[i] == 'o' && input[i] == 'u') { #paired
---
            count++;
---
        }
---
    }
---
    return count;
}

Camel case is the practice of writing phrases without spaces or punctuation, indicating the separation of words using capital letter. For example, “camel case” in camel case is “camelCase”. Snake case is the practice of writing phrases where each space is replaced by an underscore. For example, “snake case” in snake case is “snake_case”. Write the functions snakeToCamel and camelToSnake. Each function takes a string input and returns the input using the other stylization. Feel free to use any string functions you’d like. Run and test your code! Select the Parsonsprob tab for hints for the construction of the code.

Camel case is the practice of writing phrases without spaces or punctuation, indicating the separation of words using capital letter. For example, “camel case” in camel case is “camelCase”. Snake case is the practice of writing phrases where each space is replaced by an underscore. For example, “snake case” in snake case is “snake_case”. Write the functions snakeToCamel and camelToSnake. Each function takes a string input and returns the input using the other stylization. Feel free to use any string functions you’d like. Use the lines to construct the code, then go back to complete the Activecode tab.

        // snakeToCamel function
string snakeToCamel (string input) {
---
    size_t len = input.length();
---
    for (size_t i = 0; i < len; i++) {
---
        if (input[i] == '_') {
            input[i+1] = toupper(input[i+1]);
            input.erase(i,1);
        }
---
    }
    return input;
}
---
// camelToSnake function
string camelToSnake (string input) {
---
    size_t len = input.length();
---
    for (size_t i = 0; i < len; i++) {
---
        if (isupper(input.at(i))){
            input.at(i) = tolower(input.at(i));
            input.insert(i, "_");
        }
---
    }
    return input;
}

Coding Practice¶