for python programming make a program, that has a function that takes in a string argument and prints a sentence indicating the shortest word in that string. If there is more than one word print only the first. Your print statement should read: “The shortest word is x” Where x = the shortest word. The word should be all uppercase

for python programming make a program, that has a function that takes in a string argument and prints a sentence indicating the shortest word in that string. If there is more than one word print only the first. Your print statement should read: “The shortest word is x” Where x = the shortest word. The word should be all uppercase

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter7: User-defined Simple Data Types, Namespaces, And The String Type

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

// Write a function that takes 1 argument, a string. // It returns true if the string is a palindrome (the same forwards and backwards). // It returns false if the string is not a palindrome. const isPalindrome = (string) => { // your code here... // Examples isPalindrome("cat") // returns false //isPalindrome("level") // returns true }
In Python, The function add_char_counts takes three parameters: a string s and two strings of length 1, char1 and char2, and returns the total number of times either char1 or char2 appears in s. For example, the word "scallions" has 2 s's and 1 n, so add_char_counts("scallions", "s", "n") returns 3. Hint: Use a string method to help solve this problem (count). You do not need an accumulator. For example: Test Result print(add_char_counts('Indiana', 'a', 'b')) 2 print(add_char_counts('BAHAMAS', 'A', 'B')) 4 print(add_char_counts('Mississippi', 'i', 'M')) 5 print(add_char_counts("spam spam spam spam", "s", "p")) 8
In Python, program a function called "capitalizePhrases", with the following heading: # capitalizePhrases: str -> str# It receives a string with several sentences separated by ".", Where all its letters are in # uppercase and delivers the same string but with the first letter of each sentence in uppercase# and the others in lowercase:# Example: capitalizePhrases("HELLO.THAT WELL IT DIDN'T RAIN SO MUCH TODAY.BE CAREFUL."),# must deliver: "Hello.That well it didn't rain so much today.Be careful."# Observation: both in entry and exit, there is no space after a point.# Also suppose that both input and output do not include accents. (á, ó, etc.)def capitalizePhrases(upperText):
Write the following three functions A function that accepts a string as an argument and returns a copy of the string with the first character of each sentence capitalized. For instance, if the argument is “hello world”, the function returns “Hello World”. Writing the function requires splitting the sentence, then perform a loop on each word and capitalize the character at location zero- You do not need to do this, However, you do NOT need to do that, Python has a ready string method for that, your job is to find it its easy to use, and saves you plenty of work. It's impossible to know about all Python library functions in a course, but if you look in the Python documentation, you will find what you need. A function that counts the number of occurrences of given character in a given string. For example, calling the function with Count(‘h’, ‘Hi, Im here’) returns 2. Note the function counts the character regardless of case. 3. A main function, allows the user to enter inputs for…
in javas Write a function that accepts string as its argument. The function should count the number of vowels appearing in the string and return that number. Write another function that accepts a string as its argument. This function should count the number of consonants appearing in the string and return that number. Demonstrate these two functions in a program that performs the following steps: The user is asked to enter a string. The program displays the following menu: A) Count the number of vowels in the string B) Count the number of consonants in the string C) Count both the vowels and consonants in the string D) Enter another string E) Exit the program The program performs the operation selected by the user and repeats until the user selects E to exit the program.
In Python, program a function named wordsCount with the following header (hint, use the "find" function): # wordsCount: str str -> int# receives two strings: a lowercase phrase and a lowercase word.# count the number of occurrences of the word in the phrase.# example: wordsCount("abracadabra","ab") return 2# example: wordsCount("tangananicatanganana", "an") return 6# example: wordsCount("aaaaaaaaaa", "aa") return 9def wordsCount(phrase, word):...
DescriptionA researcher is analyzing DNA. A DNA can be represented as a string composed of the characters A, G, C, or T.One day, researchers found a strange DNA, which is Smooth Repeated DNA. The DNA is represented by a string that has infinite length. The string has a repeating pattern, i.e. the DNA string 0 is repeated an infinite number of times. For example, if0 = "????", then = "???????????? . . . ".According to researchers, a DNA is said to be special if it contains substrings . Determine whetheris a substring of . Squad FormatA line containing the two strings 0 and . Output FormatA line that determines whether it is a substring of . Issue “YES” ifis a substring of . Output “NO” otherwise. Example Input and Output Input Example Example Output AGCT GC YES AGCT TA YES AGCT GT No AGCT TAGCTAGCT YES AGGACCTA CTAA YES Explanation ExampleIn the first to fourth test case examples, is worth "???????????? . . . ". The part in bold is one of the…
Scrabble Scrabble is a game where players get points by spelling words. Words are scored by adding together the point values of each individual letter. Define a function scrabble_score (word:str) -> int that takes a string word as input and returns the equivalent scrabble score for that word. score = {"a": 1, "c": 3, "f": 4, "i": 1, "1": 1, "o": 1, "r": 1, "u": 1, "t": 1, "x": 8, "z": 10} For example, "b": 3, "h": 4, "n": 1, Your Answer: == 20 assert scrabble_score("quick") assert scrabble_score("code") == 7 1 # Put your answer here 2 Submit "e": 1, "d": 2, "g": 2, "k": 5, "j": 8, "m": 3, "q": 10, "p": 3, "s": 1, "w": 4, "v": 4, "y": 4,
Given a string on one line and an integer number on a second line, add a copy of the last number of characters of the string to the string's end. Then, output the result. Ex: If the input is: Fuzzy bear 4 the output is: Fuzzy bearbear Note: Using a pre-defined string function, the solution can be just one line of code. #include <iostream>#include <string>using namespace std; int main() { string strVar; int substrLen; getline(cin, strVar); cin >> substrLen; /* Your code goes here */ cout << strVar << endl; return 0;}
Create a function that takes a string of words and returns the word with the highest score. Each letter of the word gets points according to its position in the alphabet: a = 1, b = 2, C = 3, etc. Examples wordRank ("A quick brown fox.") → "brown" wordRank ("Nancy is very pretty.") "pretty" wordRank ("Come back tomorrow, man!") → "tomorrow" wordRank ("Wednesday is hump day.") "Wednesday" Solution in JS 10
Write a python function to manipulate a string. The function receives a string as its parameter and checks whether the string contains the word "bad" , then change the word to "good".
IN JAVA SCRIPT Programming Create a function that takes a string as an argument and returns true if each letter in the string is surrounded by a plus sign. Return false otherwise. Examples plusSign("+f+d+c+#+f+") → true plusSign("+d+=3=+s+") → true plusSign("f++d+g+8+") false plusSign("+s+7+fg+r+8+") → false