1. Morse code is an encoding scheme that uses dots and dashes to represent an input stream of characters. The table below shows the mapping from character to dots and dashes (only letters and digits in this case). Define a function named- encode_morse. Your function shall take a string argument as input and return the string in Morse code. Replace spaces in between words with the forward slash character (i.e. '/'). Additionally, insert a single space between character conversions. Example: 1. For an input string: 'sos' The function return will be: . 2. For an input string: 'Hello world' The function returns: ... / NB: this encoding does not support special characters, as such any special characters in the input string such as punctuation marks etc. should be ignored Character Code A B с D E F G H I ... . --. .... Character Code J K L M N 0 P Q R ---- --- -. Character Code S T U V W X Y Z 0 ... I -- Character Code 1 2 3 4 5 6 7 8 9

1. Morse code is an encoding scheme that uses dots and dashes to represent an input stream of characters. The table below shows the mapping from character to dots and dashes (only letters and digits in this case). Define a function named- encode_morse. Your function shall take a string argument as input and return the string in Morse code. Replace spaces in between words with the forward slash character (i.e. '/'). Additionally, insert a single space between character conversions. Example: 1. For an input string: 'sos' The function return will be: . 2. For an input string: 'Hello world' The function returns: ... / NB: this encoding does not support special characters, as such any special characters in the input string such as punctuation marks etc. should be ignored Character Code A B с D E F G H I ... . --. .... Character Code J K L M N 0 P Q R ---- --- -. Character Code S T U V W X Y Z 0 ... I -- Character Code 1 2 3 4 5 6 7 8 9

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 8PE: Write a program that reads in a line consisting of a students name, Social Security number, user ID,...

See similar textbooks

Similar questions

Write a function is_mirror(s) that takes as input a string s and returns True if s is a mirrored string (i.e., a string that could have been produced by your mirror function) and False otherwise. Examples:>>> is_mirror('baconnocab')True>>> print(is_mirror('baconnoca'))False
JavaScript repl For this question you will need to use the following function: • string_value.replace(/x/g,"y") returns the text in string_value except that any instance of x is replaced by y Define a function named canadianize which has one input. The input is a str and its value will be some text. The function will return that text canadianized into Canadian English. Write your function so that it starts by getting the result of replacing all of input's instances of "hat" with "tuque". Use the result of that initial function call, replace all instances of "! "with ", eh? " (note that both strings end with a single space). Your function should return the Canadian English str. Sample test cases: canadianize("Even though I hate covering my head, it was cold so I wore a hat.") would evaluate to "Even though I tuquee covering my head, it was cold so I wore a tuque." (finds bug if "hat" not replaced correctly as part of another word) canadianize ("It's cold as all get out! ") would…
Write a function replace_head_tail that takes a string str1 and replaces the first X and last Y characters of the string and returns the resulting string. For example, replace_head_tail("corona virus", 4, 3) returns "rusna vicoro".
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,
Complete the scramble_text() function that takes a single string parameter text. The function returns a new string consisting of the characters in text scrambled order - every pair of characters have their positions swapped. You can assume that the parameter text will have a length of at least 1. For strings with an odd length, the last character remains unchanged in the scrambled text. Some examples of the function being called are shown below. For example: Test text = "I". print (f"{text} --scramble--> {scramble_text (text)}") text = "Hello" print (f"{text} --scramble--> {scramble_text (text)}") text = "superb" print (f"{text} --scramble--> {scramble_text (text)}") Result I --scramble--> I Hello --scramble--> eHllo superb --scramble--> usepbr
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 python, wihtout using (replace, find, index) insert_substrings_into_string(s, substrs): This function takes a string s and a string substrs. The substrs string will contain 0 or more comma-separated substrings. The string s will contain text with 0 or more special placeholder character sequences. These placeholder character sequences will always begin with the percent character %, followed by one or more digits. The function will create a new string from the original string s where all the placeholder character sequences in s are replaced by the substrings in the string substrs. The placeholder %0 should be replaced by the first substring in substrs (i.e., everything before the first comma, if such a comma exists). The placeholder %1 should be replaced by the second substring in substrs (i.e., everything between the first and second comma, if such a comma exists), and so on. The new string should then be returned. Note: If a placeholder sequence refers to an invalid index (e.g., %10…
Write a program that reads in a line consisting of a students name, Social Security number, user ID, and password. The program outputs the string in which all the digits of the Social Security number and all the characters in the password are replaced by x. (The Social Security number is in the form 000-00-0000, and the user ID and the password do not contain any spaces.) Your program should not use the operator [] to access a string element. Use the appropriate functions described in Table 7-1.
a. Following pseudocode on slide #30, implement a function to perform binary addition. The function takes two integers as inputs, and returns the binary representation of the sum of the two numbers as a string. Note that the addition has to be performed using the binary representations of the two integers, meaning you can not do '5+8 = 13' then return the binary representation of 13. Use the following pairs to test your code: (24,98), (2387482,1), (25,25) Binary Addition of Integers Algorithms for performing operations with integers using their binary expansions are important as computer chips work with binary numbers. Each digit is called a bit. procedure add(a, b: positive integers) {the binary expansions of a and b are (a-19-2.a) and (b-1b-2²b)₂ respectively} n-2' n-2' C:=0 for j:= 0 to n-1 d:= := [(a₁ + b₁ + c)/2] s, := a₁ +b+c=2d c:= d S := C return(s,S₁,...,s){the binary expansion of the sum is (SS-₁,5)₂} The number of additions of bits used by the algorithm to add two n-bit…
Write and test a function that removes the leading and trailing spaces from a string. The function has two parameters. The first parameter is the address of the original string. The second parameter is the address of a string that is almost a copy of the original string. The difference between the strings is that the first string may have leading or trailing spaces and the second string will not have leading or trailing spaces. Use the function Str_length to compute the length of the original string
Write a function secondIndexOf, taking two strings and determining the second occurrence of the second string in the first string. If the search string does not occur twice, -1 should be returned. Example: secondIndexOf('White Rabbit', 'it') should return 10.
Python The function f(s,ch) gets a strings and a character ch. Then it returns a string that is similar to s but does NOT have the character ch. If ch does not appear in s then the result string is equal to s. Example: f('abacadaeafaga', 'a')=='bcdefg' f('abacadaeafaga', 'A')=='abacadaeafaga' Complete the following code for the function f : def f(s, ch): return