In python: Implement the get_num_of_non_WS_characters() function. get_num_of_non_WS_characters() has a string parameter and returns the number of characters in the string, excluding all whitespace. Implement the get_num_of_words() function. get_num_of_words() has a string parameter and returns the number of words in the

In python: Implement the get_num_of_non_WS_characters() function. get_num_of_non_WS_characters() has a string parameter and returns the number of characters in the string, excluding all whitespace. Implement the get_num_of_words() function. get_num_of_words() has a string parameter and returns the number of words in the

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter7: Characters, Strings, And The Stringbuilder

Section: Chapter Questions

Problem 12RQ

See similar textbooks

Similar questions

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
INSTRUCTIONS: Write a Python script/code to do the given problems. EMOTIFY PROBLEM: Create a function that takes a string and returns a string with its letters in alphabetical order. Example: alphabet_soup(“hello") - ehllo alphabet_soup(“hacker") – acehkr
python: def shakespeare_position(role, section): """ Question 2 - Regex You are reading a Shakespeare play with your friends (as one frequently does) and are given a role. You want to know what line immediately precedes YOUR first line in a given section so that you are ready to go when it is your turn. Return this line as a string, excluding the character's name. Lines will always begin with the character's name followed by a ':' and end in a "." or a "?" Each line is separated by a single space. THIS MUST BE DONE IN ONE LINE. "" Args: role (str) section (str) Returns: str section_1 = 'Benvolio: By my head, here come the Capulets. Mercutio: By my heel, I care not. ' + 'Tybalt: Gentlemen, good den - a word with one of you. Mercutio: And but one word with one of us?' >>> shakespeare_position('Tybalt', section_1) 'By my heel, I care not.' >>> shakespeare_position('Mercutio', section_1) 'By my head, here…
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
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string. This problem is an exercise in Java string manipulation. For some mysterious reason, the Java String type does not come with a reverse method. The canonical way to reverse a Java string str is to first convert it to mutable StringBuilder, reverse its contents, and convert the result back to an immutable string, that is, str = new StringBuilder(str).reverse().tostring(); A bit convoluted, but does what is needed without fuss or muss. Maybe one day the Java strings will come with the reverse method built in, just like the string data types of all sensible…
///-In python-/// def get_words_last_1():"""The function should take a list of wordsas an input parameter and return a new list of stringswith the last character removed. (Use string slicing)If the word is empty or has only 1 character, then skip it.""" pass The code should aslo have if __name__ == "__main__" section.
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string.This problem is an exercise in Java string manipulation. For some mysterious reason, the Java String type does not come with a reverse method. The canonical way to reverse a Java string str is to first convert it to mutable StringBuilder, reverse its contents, and convert the result back to an immutable string, that is,str = new StringBuilder(str).reverse().toString(); Here's the tester it must pass: @Test public void testPancakeScramble() throws IOException {// Explicit test casesassertEquals("", P2J3.pancakeScramble(""));assertEquals("alu",…
The files provided in the code editor to the right contain syntax and/or logic errors. In each case, determine and fix the problem, remove all syntax and coding errors, and run the program to ensure it works properly. // Converts a string to lowercase, and // displays the string's length // as well as a count of letters public class DebugSeven4 { public static void main(String[] args) { String aString = "HELP!! I need to get 37 things DONE today!!"; int numLetters = 0. int stringLength = aString.Length(); System.out.println("In all lowercase, the sentence is: "); for(int i = 0; i < stringLength; i++) { char ch = Character.toTheLowerCase(aString.charAt(i)); System.out.print(ch); if(Character.isLetter(ch)) numLetters--; } System.out.println(); System.out.println ("The number of CHARACTERS in the string is " + stringLength); System.out.println(The number of LETTERS is "…
RESTRICTIONS, PLEASE READ:Do it on python and do not add any imports.Do not use try-except statements. def find_email(s: str) -> str: """ Given a string <s>, return the email that exists in the string. Preconditions: <s> contains at most 1 email, or none at all. If <s> does not contain an email, return the empty string. Email definition: An email address is defined as 'name@domain.com' or 'name@domain.ca' with the following specifications: name: the name is an alphanumeric string that is less than or equal to 12 characters. Additional characters allowed are dash (-), period (.) and underscore (_). But the email cannot start or end with these additional characters. The name must also be at least 1 character long. Example names: a ab a_b…
def swap_text(text): Backstory: Luffy wants to organize a surprise party for his friend Zoro and he wants to send a message to his friends, but he wants to encrypt the message so that Zoro cannot easily read it. The message is encrypted by exchanging pairs of characters. Description: This function gets a text (string) and creates a new text by swapping each pair of characters, and returns a string with the modified text. For example, suppose the text has 6 characters, then it swaps the first with the second, the third with the fourth and the fifth with the sixth character. Parameters: text is a string (its length could be 0)Return value: A string that is generated by swapping pairs of characters. Note that if the Examples: swap_text ("hello") swap_text ("Party for Zoro!") swap_text ("") def which_day(numbers): → 'ehllo'→ 'aPtr yof roZor!' → '' length of the text is odd, the last character remains in the same position.
2- Write a C# program that read a string and split this string according to space char into an array of strings using Substring, IndexOf (or LastIndexOf) The book on the Ex : strl ="The book on the table, the pen" -→ result= table the реп
Using Python The Soundex algorithm is used to encode strings. The result of the algorithm is a letter followed by three digits. Similar words will have the same code. For example, Adams and Addams would have the same code. There are several different algorithms for Soundex. Using Python, this online interpreter, and the below listed requirements, create an application that will produce a Soundex-like code based on user-entered string: The first letter of the word is the first letter of the Soundex code. Remove or ignore all letters a, e, i, o, u, h, y, and w. Replace the letters that remain, as follows: Replace this: With this: b, f, p, and v 1 c, g, j, k, q, s, x, and z 2 d and t 3 l 4 m and n 5 R 6 If two or more digits are identical (e.g., 11, 222), only keep the first digit. Choose the first 3 digits, and append to the first letter from Step 1. If you only have 1 or 2 digits, append 0s at the end for the final code.