Prompt the user to enter a string of their choosing (assume no punctuation). Store the text in a string. Split the string into words and print out a sorted list of the words. Use a function print_words() to do this printing; it has a list of words as a parameter and prints each word on a a single line separated by spaces. When done printing the line, print a newline character. Now implement a convert_words() function, which has a list of words as a parameter, and returns a list of words all in lower case. Then extend your program to prompt the user as before, but this time also convert the words to lower case using convert_words(), sort them, and then print the list of lower case words again using print_words(). See the following Implement a remove_duplicates() function, which has a list of words that has been sorted as a parameter, and returns a list of words with duplicates removed. Then extend your program to print the sorted list of words all in lower case but without duplicate words, such as the following:

Prompt the user to enter a string of their choosing (assume no punctuation). Store the text in a string. Split the string into words and print out a sorted list of the words. Use a function print_words() to do this printing; it has a list of words as a parameter and prints each word on a a single line separated by spaces. When done printing the line, print a newline character. Now implement a convert_words() function, which has a list of words as a parameter, and returns a list of words all in lower case. Then extend your program to prompt the user as before, but this time also convert the words to lower case using convert_words(), sort them, and then print the list of lower case words again using print_words(). See the following Implement a remove_duplicates() function, which has a list of words that has been sorted as a parameter, and returns a list of words with duplicates removed. Then extend your program to print the sorted list of words all in lower case but without duplicate words, such as the following:

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18PE

See similar textbooks

Similar questions

Write a function filter_words_end_ie(word_list) that uses a regex to filter (select) the words from a given list that end with ie. Examples: >> filter_words_end_ie(['hello', 'bye', 'goalie', 'newbie', 'zero', 'rieb', 'zombie', 'zoom', 'ierapetra']) ['goalie', 'newbie', 'zombie']
String replacement is read from input. Then, sentence is read from input. If replacement is in sentence, then: Output 'Located at index: ' followed by the index of the last occurrence. Create a string from sentence with the first two occurrences of replacement replaced by '5' and output sentence on a newline.
) Write list comprehensions to generate the following:i) If numlist contains a list of numbers, create a new list that contains only thosenumbers that are less than 100. (e.g. [42, 130, 7, 100, 101] becomes [42, 7])ii) The numbers from 3 to 30 that are multiples of 3 (i.e. 3, 6, 9, 12, 15... 30)iii) The numbers from 3 to 30 that are multiples of both 3 and 2 (i.e. 6, 12, 18...)iv) If wordlist contains a list of strings, create a new list that has the words that startwith “p” or “P”. (e.g. [“Apple”, “pear”, “avocado”, “Pumpkin”] becomes[“pear”,”Pumpkin”] )
PYTHON CODING This function takes a list of points and then returns a new list of points, which starts with the first point that was given in the list, and then followed by points closest to the start point. Example: points = [a, b, c, d, e, f, g] point a is the strating point soe the new list must start with a. we then use the fistance function to calculate which points will be closest to a. lets say f is closest to a, therefore, second point in the new list will be f. Next we find which point is closest to f, lets say b is closest, therefore b is the next point in our new list, and so on. new list = [a, f, b, ......] ------- Here is the function that needs to be created: def solution_path(points) : # insert code here return path Please use any of the following function to develop the solution_path function Distance function - calculates the distance between two points def distance(p1, p2) : distance = sqrt (((p1 [0] - p2 [0]) **2) + ((p1 [1] - p2 [1]) **2)) return…
This is what im following my_flower1 = input()my_flower2 = input()my_flower3 = input() your_flower1 = input()your_flower2 = input() their_flower = input() # 1. TODO: Define my_list containing my_flower1, my_flower2, and my_flower3# in that order # 2. TODO: Define your_list containing your_flower1 and your_flower2# in that order # 3. TODO: Define our_list by concatenating my_list and your_list print(our_list) # 4. TODO: Append their_flower to the end of our_list print(our_list) # 5. TODO: Replace my_flower2 in our_list with their_flower print(our_list) # 6. TODO: Remove the first occurrence of their_flower from# our_list without using index() print(our_list) # 7. TODO: Remove the second element of our_list print(our_list)
I need a new line at the end of the new sentence3. Right now I have a good code but a space after sentence. #Define main functiondef main(): word_pairs = input()#Split words into list word_pairs = word_pairs.split()#Create lists for original and replacement words original = [] new = []#Iterate word_pair for i in range(len(word_pairs)): if i % 2 == 0: original.append(word_pairs[i]) else: new.append(word_pairs[i]) sentence = input()#Split sentence into list sentence = sentence.split() #Iterate sentence for i in range(len(sentence)):#Iterate original for j in range(len(original)):#Check to see is words match in sentence if sentence[i] == original[j]:#Replace original word with new word sentence[i] = new[j]#Print output for i in range(len(sentence)):print(sentence[i], end = " ") #Call main() functionif __name__=="__main__":main()
Words with given shape def words_with_given_shape(words, shape): The shape of the given word of length n is a list of n - 1 integers, each one either -1, 0 or +1 to indicate whether the next letter following the letter in that position comes later (+1), is the same (0) or comes earlier (-1) in the alphabetical order of English letters. For example, the shape of the word 'hello' is [-1, +1, 0, +1], whereas the shape of 'world' is [-1, +1, -1, -1]. Find and return a list of all words that have that particular shape, listed in alphabetical order. Note that your function, same as all the other functions specified in this document that operate on lists of words, should not itself try to read the wordlist file words_sorted.txt, even when Python makes this possible with just a couple of lines of code. The tester script already reads in the entire wordlist and builds the list of words from there. Your function should use this given list of words without even caring which particular file it…
Words with given shape def words_with_given_shape(words, shape): The shape of the given word of length n is a list of n - 1 integers, each one either -1, 0 or +1 to indicate whether the next letter following the letter in that position comes later (+1), is the same (0) or comes earlier (-1) in the alphabetical order of English letters. For example, the shape of the word 'hello' is [-1, +1, 0, +1], whereas the shape of 'world' is [-1, +1, -1, -1]. Find and return a list of all words that have that particular shape, listed in alphabetical order. Note that your function, same as all the other functions speci0ied in this document that operate on lists of words, should not itself try to read the wordlist 0ile words_sorted.txt, even when Python makes this possible with just a couple of lines of code. The tester script already reads in the entire wordlist and builds the list of words from there. Your function should use this given list of words without even caring which particular 0ile it…
The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths. The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted. The remaining items from the other list are then appended to the end of the new list, and the new list is returned. For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"]. HINT: Python has a built-in function min() which is helpful here. Initialize accumulator variable newlist to be an empty list Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration). AFTER the loop…
def print_categories(main_list): for i in all_categories: main_list = all_categories.split() print(i,":",all_categories[i]) return "" """ Given a list of lists, for each list stored in main_list, output its contents as follows: f"{index of category}. {item[0]} - {item[1]}%". note that indexing must start at 1 for the first item, not 0, which is first item's actual index in main_list. If `main_list` is empty, the function prints "There are no categories." Returns the number of categories.
Computer Science (in picat) 10. split list(Lst,N): split Ist into two parts with the first part having N elements, and return a list that contains these two parts. 12. min max median(st): a function that takes a simple list of numbers Ist as a parameter and returns a list with the min, max, and the median of Ist. Can you devise an algorithm that has an expected linear running time?
3) There is a simple card game played with a deck of cards where a player receives four cards and two of those cards have to be same (they have to form a pair) in order to win. The computer has to determine if the player won using just one complex if statement. a) Create a systematic list of the possible combinations of cards that could form a pair (for example, Card1 & Card 2 could have the same value and make a pair). Use the table structure below. Card 1 Card 2 Card 3 Card 4 X X