Write a Python program that reads a word and prints all substrings, sorted by length, or an empty string to terminate the program. Printing all substring must be done by a function call it printSubstrings which takes a string as its parameter. The program must loop to read another word until the user enter an empty string. Sample program run: Enter a string or an empty string to terminate the program: sit S i t si it sit Enter a string or an empty string to terminate the program: Code с COD d e Co od de Cod ode Code Enter a string or an empty string to terminate the program: Done...

Write a Python program that reads a word and prints all substrings, sorted by length, or an empty string to terminate the program. Printing all substring must be done by a function call it printSubstrings which takes a string as its parameter. The program must loop to read another word until the user enter an empty string. Sample program run: Enter a string or an empty string to terminate the program: sit S i t si it sit Enter a string or an empty string to terminate the program: Code с COD d e Co od de Cod ode Code Enter a string or an empty string to terminate the program: Done...

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter6: User-defined Functions

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

(Program) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters, such as zerocount, onecount, twocount, and so forth, to 0. Then generate a large number of pseudorandom integers between 0 and 9. Each time 0 occurs, increment zerocount; when 1 occurs, increment onecount; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of time they occurred.
Write a python program that will take two inputs from the user. One string with a length greater than 2 One number (integer) [Assume the number is always less than the length of the given string.] Your task is to check which indexes of the given string are divisible by the given number. If the character of the divisible index is a vowel (a, e, i, o, u), then replace it with “YES”. Otherwise, replace it with “NO”. [Cannot use built-in replace function.] ======================================================================== Sample Input 1: Python is love 3 Sample Output 1: NOytNOonNOisNOloNOe Explanation 1: None of the indexes divisible by 3 has any vowels. Therefore all of the corresponding characters were replaced by “NO”. ======================================================================== Sample Input 2: Python is good 4 Sample Output 2: NOythYESn iNO goYESd Explanation 2: The 4th and 12th index is divisible by 4 and also contain one of the vowels. Therefore…
Write a python program that can tell if two strings are anagrams with each other. Anagrams are strings can be formed from one another by rearranging the letters. We only consider letters a-z A-Z and digits 0-9 in our strings and ignore all other characters (spaces, punctuation marks and so on.) and we ignore cases of letters (e.g. a and A are considered the same) for comparison. Your program must define is_anagram(s1, s2) function that returns True when s1 and s2 are anagrams and returns False when they are not.
Write a program in python with a function repeatPhrase(phrase, n), which prints the given phrase n times, alternating between lowercase and uppercase. For example, repeat('The sky is yellow', 5) would print: the sky is yellowTHE SKY IS YELLOW the sky is yellowTHE SKY IS YELLOW the sky is yellow
Write a python function count_matches that, given two strings, counts the number of positions at which the characters are the same. For example, count_matches('conflate', 'banana') returns 2, conflate banana ^ ^ since the n's match at index 1 and the a's match at index 5. The strings to not need to be the same length. The count_matches function does not read input or print output.
Write a program that inputs a line of text and a search string from the keyboard. Using function strstr, locate the first occurrence of the search string in the line of text, and assign the location to variable searchPtr of type char *. If the search string is found, print the remainder of the line of text beginning with the search string. Then, use strstr again to locate the next occurrence of the search string in the line of text. If a second occurrence is found, print the remainder of the line of text beginning with the second occurrence. input Input a line of text and a search string. Maximum number of char is 200. Output Print the remainder of the line of text beginning with the search string.
Implement a function that checks whether a given string is a palindrome or not. A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward, disregarding any spaces, punctuation, or capitalization. Write a function named isPalindrome that takes a string as input and returns True if it is a palindrome, and False otherwise. Example: Input: "racecar" Output: True Input: "hello" Output: False Input: "A man, a plan, a canal: Panama" Output: True Write the isPalindrome function that solves this problem efficiently.
Write a program in Python with a function biggestOdd(), which reads in numbers from the user until the user enters 0. Then the function returns (not prints) the largest odd number that was entered. For example, if the integers were: 10, 9, 7, 12, 2, 5, 15, 100, 90, 60, 0, then the program would return 15 as the largest odd number. Similarly, if the integers were -55, -33, -10, 100, -5, 0, then the program would return -33 as the largest odd number. If there is no odd number, then the function should return 0.
Write a program in Python with a function decimalToBinary(n) that converts a positive decimal integer n to a string representing the corresponding binary number. Do the conversion by repeatedly dividing the number n by 2 using integer division, keeping track of the remainders, until the number is reduced to 0. The remainders written in reverse order form the binary number string.
Write a Python Program to Count Occurrences of a certain Character in a String. The user inputs a string value and the character to search. For example, if the string input value is PHILIPPINES and the character value is P, the output is value 3. There are 3 occurrences of P in the PHILIPPINES. The program must count the same character whether it is in lowercase or uppercase.
Write a Java function that counts the number of 'x's in the string. Any 'x' that is followed by another 'x' should count double (e.g. "axxbxc" -> 4) /** * Count the number of 'x's in the string. Any 'x' that is followed by * another 'x' should count double (e.g. "axxbxc" -> 4) * * @param x a string. * @return the count of x's. */ public static int countXWithDubs(String s){ return -1; }
Write a python program that takes a string parameter called sentence as the input parameter. This parameter may contain any number of words (one or more letters separated by spaces) and the following three punctuation marks '!' ';' '.' . For example, sentence = "here are some words." or another_sentence = "wow!" Your function must extract each word from the sentence, remove the punctuation marks if there is any, and make the first and the last letters of that word uppercase. For example, "here" will be "HerE", "some" will be "SomE", "wow" will be "WoW" etc. Finally, your function must return a dictionary, where keys of this dictionary are the words of the sentence capitalized as above. For each key (i.e., word) the value should be the length of that word. You are not allowed to use the built-in string.title() method or any negative indexing. You may use any other string methods in your solution. Sample outputs: >>> d = cap_ends("here are some words.") >>>…