String Challenge Have the function StringChallenge (str) take the str parameter being passed, which will be a positive integer, take its binary representation (padded to the nearest N * 8 bits), reverse that string of bits, and then finally return the new reversed string in decimal form. For example: if str is "47" then the binary version of this integer is 101111 but we pad it to be 00101111. Your program should reverse this binary string which then becomes: 11110100 and then finally return the decimal version of this string, which is 244. Examples Input: "213" Output: 171 Input: "4567" Output: 60296

String Challenge Have the function StringChallenge (str) take the str parameter being passed, which will be a positive integer, take its binary representation (padded to the nearest N * 8 bits), reverse that string of bits, and then finally return the new reversed string in decimal form. For example: if str is "47" then the binary version of this integer is 101111 but we pad it to be 00101111. Your program should reverse this binary string which then becomes: 11110100 and then finally return the decimal version of this string, which is 244. Examples Input: "213" Output: 171 Input: "4567" Output: 60296

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

def substring_with_largest_sum(string: str) -> str:"""Given a string <string>, return the substring with the largest sum (ascalculated by sum_string()) that exists within <string>. If there aremultiple substrings with equally large sums, return the first one thatoccurs. The substring could just be the whole string itself, or it couldbe empty. To calculate the sum of the substring, please use the function sum_string()which you have implemented above as a helper. For example, given the string "321", there are 7 possible substrings:"", "3", "2", "1", "32", "21", "321". For each one of them, their sum canbe calculated as per the sum_string() function which you have alreadyimplemented. By using your understanding of loops, implement this functionto return the substring with the largest sum by checking all of thesubstrings of the input string. So, "32" evaluates to 1, "21" alsoevaluates to 1, "321" evaluates to 2, resulting in "3" being the largestpossible substring as it…
def substring_with_largest_sum(string: str) -> str:"""Given a string <string>, return the substring with the largest sum (ascalculated by sum_string()) that exists within <string>. If there aremultiple substrings with equally large sums, return the first one thatoccurs. The substring could just be the whole string itself, or it couldbe empty. To calculate the sum of the substring, please use the function sum_string()which you have implemented above as a helper. For example, given the string "321", there are 7 possible substrings:"", "3", "2", "1", "32", "21", "321". For each one of them, their sum canbe calculated as per the sum_string() function which you have alreadyimplemented. By using your understanding of loops, implement this functionto return the substring with the largest sum by checking all of thesubstrings of the input string. So, "32" evaluates to 1, "21" alsoevaluates to 1, "321" evaluates to 2, resulting in "3" being the largestpossible substring as it…
The international standard letter/number mapping for telephones is: Write a function that returns a number, given an uppercase letter, as follows:def getNumber(uppercaseLetter):Write a test program that prompts the user to enter a phone number as a string. The input number may contain letters. The program translates a letter (uppercase or lowercase) to a digit and leaves all other characters intact. Here is a sample run of the program: Enter a string: 1-800 flowers1-800-3569377
(4) Implement the GetNumOfWords() function. GetNumOfWords() has a constant string as a parameter and returns the number of words in the string. Hint: Words end when a space is reached except for the last word in a sentence. Call GetNumOfWords() in the PrintMenu() function.Ex: Number of words: 35
Task 2: Implement the function Searchingstrings that allow to search a sub-string in a given string and display the: First occurrence, Last occurrence, First occurrence from a given index and Last occurrence from a given index. You can use the following String methods: string. IndexOf(searchvalue, start) return the position of the first occurrence of specified character(s) in a string. string.lastIndexOf(searchvalue, start) return the position of the last occurrence of specified character(s) in a string. You can use the following string to test your solution: var letters = "abcdefghijklmnopqrstuvwxyzabcdefghijklm"; Write the code in a separate.js and separate.html file.
In the space below, write a function Def countVowels(wordPhrase): that returns a count of all vowels in wordPhrase. Vowels are the letters a, e, i, o, u, and their uppercase variants.
def sum_string(string: str) -> int:"""Given a string <string>, return the sum of this string, as computed by theformula given below: To compute the sum of a string as defined by this function, we add everyodd positioned digit, and subtract every even positioned digit. For example,if we had an input of "54321", we would add 5, subtract 4, add 3, subtract2, and add 1, bringing us to a total of 3. In other words, you would add thefirst digit, subtract the second digit, and keep alternating until you reachthe end of the string. If the string is empty, then the sum is 0. Note: since we give the input as a string, you will have to do some typeconversion in order to solve this problem. Precondition: <string> will only contain the characters 0-9."""pass " please do this on python and don't use any import functions"
Please answer it in Python write a function word_vers_dictionary(word), which takes a word (string) and returns the corresponding dictionary. For example: >>>word_vers_dictionary("tasses ") #return => {'a': 1, 's': 3, 'e': 1, 't': 1} Using the mot_vers_dictionnaire function, write a function is_anagramme(letters, word) that sends True if the string letters is an anagram of the word word, False otherwise. . For example : >>> is_anagramme("tusla", "hi") True >>> is_anagramme("salus", "salut") False
Implement the following function which accepts a string as parameter and reverses it, without using any function from the string library. void strReverse(char *str)
code should be python: write a function that allows the input of a list of strings as its only parameter. Inside the body of the function find the first palindromic word and return it. If there is no such word, it should return an empty string. A string is palindromic if it reads the same forward and backward so for example If we call the function with [“horse”, “rat”, “roar”, “dad”, “mom”], the returned value should be “dad”. Note that “mom” is also a palindrome, but it is not the first one.
write a function Def countVowels(wordPhrase): that returns a count of all vowels in wordPhrase. Vowels are the letters a, e, i, o, u, and their uppercase variants.
3. CODE IN PYTHON For this exercise, accept a string input from the user and pass that input to a function. That function should count the letters (lowercased) of the string in a dictionary and then return that dictionary. Print out the resulting dictionary.