Building a String LibrarySometimes when programming you need to introduce a new data type and develop a library of functions for manipulating instances of that data type. Often this is done as methods on a new class but not always.In this assignment, you'll be defining a collection of functions on strings, most of which already exist as methods on the str class. However, you should pretend that they don't already exist and define them as functions. Of course, you can't just use the existing methods. This will give you a bunch of practice on manipulating strings and also on defining functions.In this assignment, you'll be defining a collection of functions on strings. You should define each of these as a new function with a function header as below. The description of each is in the comment supplied. Recall that strings are immutable, so you will have to return a new copy of the string for those that call for you to return a string. If you are returning the same string as the input, just return it; there is no need to make a new copy, and it wouldn't anyway.The only string functions/methods to use:ord, chrindexing and slicingappend (i.e., ``+'')len, in, not inequality comparison (== or !=))Looping over strings (while or for loops) and selection (if statements) are allowed. BUT You cannot convert the strings to other types such as lists.Define each of the following functions, with semantics as indicated by the comment. In each of the following ch is a single character, str, str1, str2 are strings, and i is a non-negative integer. You do not have to validate the inputs, except as indicated; you can assume these types.At least one question asks you to return two values. That really means returning a tuple (pair) of values. You do that as follows: return value1, value2This actually returns the pair (value1, value2). The caller can then assign the members of the pair to two variables: x, y = pairReturningFunction() # assumes function returns a pair z, w = (value1, value2) # assigning a tuple to 2 variablesIf you like, you can use earlier functions in later ones, or define helper functions, though it shouldn't really be necessary. Note that some of these are trivial to write, while others are a bit harder. I have done the first one for you.def myAppend( str, ch ): # Return a new string that is like str but with # character ch added at the end return str + chdef myCount( str, ch ): # Return the number of times character ch appears # in str.def myExtend( str1, str2 ): # Return a new string that contains the elements of # str1 followed by the elements of str2, in the same # order they appear in str2.def myMin( str ): # Return the character in str with the lowest ASCII code. # If str is empty, print "Empty string: no min value" # and return None.def myInsert( str, i, ch ): # Return a new string like str except that ch has been # inserted at the ith position. I.e., the string is now # one character longer than before. Print "Invalid index" if # i is greater than the length of str and return None.def myPop( str, i ): # Return two results: # 1. a new string that is like str but with the ith # element removed; # 2. the value that was removed. # Print "Invalid index" if i is greater than or # equal to len(str), and return str unchanged and Nonedef myFind( str, ch ): # Return the index of the first (leftmost) occurrence of # ch in str, if any. Return -1 if ch does not occur in str.def myRFind( str, ch ): # Return the index of the last (rightmost) occurrence of # ch in str, if any. Return -1 if ch does not occur in str.def myRemove( str, ch ): # Return a new string with the first occurrence of ch # removed. If there is none, return str.def myRemoveAll( str, ch ): # Return a new string with all occurrences of ch. # removed. If there are none, return str.def myReverse( str ): # Return a new string like str but with the characters # in the reverse order. Expected output:>>> from MyStringFunctions import *>>> s1 = "abcd" >>> s2 = "efgh">>> myAppend( s1, "e" )'abcde'>>> myCount( s1, "e")0>>> myCount( s1, "a")1>>> myCount( "abcabc", "a")2>>> myExtend( s1, s2 )'abcdefgh'>>> myMin( "" )Empty string: no min value # Note the None doesn't print>>> myMin( "zqralm" )'a'>>> myMin( "Hello World!" )' '>>> myInsert( "abc", 0, "d")'dabc'>>> myInsert( "abc", 2, "d")'abdc'>>> myInsert( "abc", 4, "d") Invalid index # Note the None doesn't print>>> myPop( "abcd", 1 )('acd', 'b')>>> myPop( "abcd", 0 )('bcd', 'a')>>> myPop( "abcd", 5)Invalid index('abcd', None)>>> myFind( "abcdabcd", "a")0>>> myFind( "abcdabcd", "c")2>>> myFind( "abcdabcd", "f")-1>>> myRFind("abcdabcd", "d")7>>> myRFind("abcdabcd", "e")-1>>> myRemove( "abcdabcd", "a")'bcdabcd'>>> myRemove( "abcdabcd", "x")'abcdabcd'>>> myRemove( "abcdabcd", "d")'abcabcd'>>> myRemoveAll("abcabcabca", "a")'bcbcbc'>>> myReverse( "abcd" )'dcba'>>> myReverse( "" )''

Question

Building a String LibrarySometimes when programming you need to introduce a new data type and develop a library of functions for manipulating instances of that data type. Often this is done as methods on a new class but not always.In this assignment, you'll be defining a collection of functions on strings, most of which already exist as methods on the str class. However, you should pretend that they don't already exist and define them as functions. Of course, you can't just use the existing methods. This will give you a bunch of practice on manipulating strings and also on defining functions.In this assignment, you'll be defining a collection of functions on strings. You should define each of these as a new function with a function header as below. The description of each is in the comment supplied. Recall that strings are immutable, so you will have to return a new copy of the string for those that call for you to return a string. If you are returning the same string as the input, just return it; there is no need to make a new copy, and it wouldn't anyway.The only string functions/methods to use:ord, chrindexing and slicingappend (i.e., ``+'')len, in, not inequality comparison (== or !=))Looping over strings (while or for loops) and selection (if statements) are allowed. BUT You cannot convert the strings to other types such as lists.Define each of the following functions, with semantics as indicated by the comment. In each of the following ch is a single character, str, str1, str2 are strings, and i is a non-negative integer. You do not have to validate the inputs, except as indicated; you can assume these types.At least one question asks you to return two values. That really means returning a tuple (pair) of values. You do that as follows: return value1, value2This actually returns the pair (value1, value2). The caller can then assign the members of the pair to two variables: x, y = pairReturningFunction() # assumes function returns a pair z, w = (value1, value2) # assigning a tuple to 2 variablesIf you like, you can use earlier functions in later ones, or define helper functions, though it shouldn't really be necessary. Note that some of these are trivial to write, while others are a bit harder. I have done the first one for you.def myAppend( str, ch ): # Return a new string that is like str but with # character ch added at the end return str + chdef myCount( str, ch ): # Return the number of times character ch appears # in str.def myExtend( str1, str2 ): # Return a new string that contains the elements of # str1 followed by the elements of str2, in the same # order they appear in str2.def myMin( str ): # Return the character in str with the lowest ASCII code. # If str is empty, print "Empty string: no min value" # and return None.def myInsert( str, i, ch ): # Return a new string like str except that ch has been # inserted at the ith position. I.e., the string is now # one character longer than before. Print "Invalid index" if # i is greater than the length of str and return None.def myPop( str, i ): # Return two results: # 1. a new string that is like str but with the ith # element removed; # 2. the value that was removed. # Print "Invalid index" if i is greater than or # equal to len(str), and return str unchanged and Nonedef myFind( str, ch ): # Return the index of the first (leftmost) occurrence of # ch in str, if any. Return -1 if ch does not occur in str.def myRFind( str, ch ): # Return the index of the last (rightmost) occurrence of # ch in str, if any. Return -1 if ch does not occur in str.def myRemove( str, ch ): # Return a new string with the first occurrence of ch # removed. If there is none, return str.def myRemoveAll( str, ch ): # Return a new string with all occurrences of ch. # removed. If there are none, return str.def myReverse( str ): # Return a new string like str but with the characters # in the reverse order. Expected output:&gt;&gt;&gt; from MyStringFunctions import *&gt;&gt;&gt; s1 = "abcd" &gt;&gt;&gt; s2 = "efgh"&gt;&gt;&gt; myAppend( s1, "e" )'abcde'&gt;&gt;&gt; myCount( s1, "e")0&gt;&gt;&gt; myCount( s1, "a")1&gt;&gt;&gt; myCount( "abcabc", "a")2&gt;&gt;&gt; myExtend( s1, s2 )'abcdefgh'&gt;&gt;&gt; myMin( "" )Empty string: no min value # Note the None doesn't print&gt;&gt;&gt; myMin( "zqralm" )'a'&gt;&gt;&gt; myMin( "Hello World!" )' '&gt;&gt;&gt; myInsert( "abc", 0, "d")'dabc'&gt;&gt;&gt; myInsert( "abc", 2, "d")'abdc'&gt;&gt;&gt; myInsert( "abc", 4, "d") Invalid index # Note the None doesn't print&gt;&gt;&gt; myPop( "abcd", 1 )('acd', 'b')&gt;&gt;&gt; myPop( "abcd", 0 )('bcd', 'a')&gt;&gt;&gt; myPop( "abcd", 5)Invalid index('abcd', None)&gt;&gt;&gt; myFind( "abcdabcd", "a")0&gt;&gt;&gt; myFind( "abcdabcd", "c")2&gt;&gt;&gt; myFind( "abcdabcd", "f")-1&gt;&gt;&gt; myRFind("abcdabcd", "d")7&gt;&gt;&gt; myRFind("abcdabcd", "e")-1&gt;&gt;&gt; myRemove( "abcdabcd", "a")'bcdabcd'&gt;&gt;&gt; myRemove( "abcdabcd", "x")'abcdabcd'&gt;&gt;&gt; myRemove( "abcdabcd", "d")'abcabcd'&gt;&gt;&gt; myRemoveAll("abcabcabca", "a")'bcbcbc'&gt;&gt;&gt; myReverse( "abcd" )'dcba'&gt;&gt;&gt; myReverse( "" )''

effertz.magdalena · Accepted Answer

Code:def myAppend( str, ch ): # Return a new string that is like str but with # character ch added at the end return str + chdef myCount( str, ch ): # Return the number of times character ch appears # in str. # initiaalizing count with 0 count = 0 # iterating over every characters present in str for character in str: # incrementing count by 1 if character == ch if character == ch: count += 1 # returning count return countdef myExtend( str1, str2 ): # Return a new string that contains the elements of # str1 followed by the elements of str2, in the same # order they appear in str2. # concatenating both strings and returning its result return str1 + str2def myMin( str ): # Return the character in str with the lowest ASCII code. # If str is empty, print "Empty string: no min value" # and return None. if str == "": print("Empty string: no min value") return None # storing first character from str in char char = str[0] # iterating over every characters present in str for character in str: # if current character is lower than char then # assigning char with current character if character &lt; char: char = character # returning char return chardef myInsert( str, i, ch ): # Return a new string like str except that ch has been # inserted at the ith position. I.e., the string is now # one character longer than before. # Print "Invalid index" if # i is greater than the length of str and return None. if i &gt; len(str): print("Invalid index") return None # str[:i] gives substring starting from 0 and upto ith position # str[i:] gives substring starting from i and till last position # returning the concatenated result of all three return str[:i]+ch+str[i:]def myPop( str, i ): # Return two results: # 1. a new string that is like str but with the ith # element removed; # 2. the value that was removed. # Print "Invalid index" if i is greater than or # equal to len(str), and return str unchanged and None if i &gt;= len(str): print("Invalid index") return str, None # finding new string without ith character new_str = str[:i] + str[i+1:] # returning new_str and popped character return new_str, str[i]def myFind( str, ch ): # Return the index of the first (leftmost) occurrence of # ch in str, if any. Return -1 if ch does not occur in str. # finding length of the string length = len(str) # iterating over every characters present in str for i in range(length): # returning position i at which character was found if str[i]==ch: return i # returning -1 otherwise return -1def myRFind( str, ch ): # Return the index of the last (rightmost) occurrence of # ch in str, if any. Return -1 if ch does not occur in str. # finding length of the string length = len(str) # iterating over every characters present in str from right side for i in range(length-1, 0, -1): # returning position i at which character was found if str[i]==ch: return i # returning -1 otherwise return -1def myRemove( str, ch ): # Return a new string with the first occurrence of ch # removed. If there is none, return str. # returning str if ch is not present in str if ch not in str: return str # finding position of first occurence of ch in str pos = 0 for char in str: # stopping loop if both character matches if char == ch: break # incrementing pos by 1 pos += 1 # returning strig excluding first occurence of ch return str[:pos] + str[pos+1:]def myRemoveAll( str, ch ): # Return a new string with all occurrences of ch. # removed. If there are none, return str. # creating an empty string string = "" # iterating over each and every character of str for char in str: # if char is not matching with ch then adding it to string if char!=ch: string += char # returning string return stringdef myReverse( str ): # Return a new string like str but with the characters # in the reverse order. return str[::-1]

Answers

Related Questions

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers