Processing lists of strings is often very useful. The following exercise processes lists of words (strings) in several ways.(1) Prompt the user to enter a string of their choosing (assume no punctuation). Store the text in a string. Split the string into words andprint 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 eachword on a a single line separated by spaces. When done printing the line, print a newline character risEx:Enter a sentence (without punctuation):This Is a Sentence That Repeats this is a sentence that repeats but has different words withCapitalsSorted list of words:Capitals Is Repeats Sentence That This a but different has is repeats sentence that this withwords

The required Python code is: def print_words(lst): # function to display list of words # sort the…

Answered: Processing lists of strings is often…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

In python, remove_from_list(my_list, indices): Takes two lists as input. Creates a new list from the first input list by removing the elements at indices given by the integers in the second input list, then return the new list. The indices in the second input list may have any order. For example, if the first input list is [4, 8, 12, 16], and the second input list is [0, 2], then the new list returned from the function should have the 4 and the 12 removed, because they were at indices 0 and 2 of the original list. Note: You do not need to consider negative indices for this function. >>> remove_from_list(['abc', 'def', 'ghi'], [1]) ['abc', 'ghi'] >>> strs = ['The', 'quick', 'brown', 'fox'] >>> remove_from_list(strs, [0, 3]) ['quick', 'brown'] >>> strs ['The', 'quick', 'brown', 'fox'] # original list is unchanged >>> remove_from_list(['The', 'quick', 'brown', 'fox'], [3, 0]) ['quick', 'brown']
WRITE THE MAIN.CPP FOR THIS PROGRAM a. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).
Using Binary Search, write a function in Python named length_of_line, which takes two inputs: points_lists – The list containing nested lists of starting and ending x and y coordinates of different lines. For e.g: [[(x1, y1), (x2, y2)], [(x1, y1), (x2, y2)], [(x1, y1), (x2, y2)], [(x1, y1), (x2, y2)]]. length – The length of a line. Now determine, if any line present in the points_lists has a same length as that of required length.Return the index of that line. If the line is not found, return -1. Hint: Estimate the length of a line with the help of the distance formula. test cases below: >>> length_of_line([[(2,4),(4,6)], [(1,2),(4,6)], [(4,0),(6, 6)]], 5.0) 1 >>> length_of_line([ [(2,4),(4,6)], [(1,2),(4,6)],[(4,0),(6, 6)]], 6.32) 2 >>> length_of_line([ [(2,4),(4,6)], [(1,2),(4,6)],[(4,0),(6, 6)]], 1.0) -1
7) Use a counting sort on a set of keys that fall between (a, b), where a and b are modest positive numbers that the user inputs. 8) For an acceptable selection of the number of buckets, implement bucket sort with an array of lists data structure to sort a list of characters, a list of floating point values, and a list of uniformly distributed integers.
Write a version of the sequential search algorithm that can be used to search a sorted list. Write a program to test the sequential search algorithm. Use either the function bubbleSort or insertionSort to sort the list before the search. Your program should prompt the user to enter 10 digits and then prompt the user to enter a digit to search - if the list contains this digit, output its position to the console: x is found at position y If the digit is not contained in the list, output the following: x is not in the list
Please answer it in Python Write a function last_consonant that takes as an argument a word and returns two return values: the index of its last consonant as well as the last consonant (as for lists, we will consider that the index of the first letter is zero). We will not deal with the problematic case where the word does not contain a consonant. Example: last_consonant('arrivee') returns 4, 'v' Write a function double_consonant that takes as an argument a word and has two return values: a Boolean worth True if the word contains a double consonant (twice the same consonant in a row), and in this case the second return value is the consonant that is doubled; If there is no doubled consonant, the function must return False and None. If the word contains several double consonants (for example, 'successor'), true will be returned and the first double consonant appearing in the word. Examples: double_consonant('arrive') is true, 'r'. double_consonant ('candy') is false, None…
Please answer it in Python Write a decale function that takes as an argument a list l and a number d and returns the list obtained from l by adding an offset of d to each element of l. Example: decale([4, 17, 12], 3) is [7, 20, 15]. Write a function intercale_zeros that takes as an argument a list l and returns the list obtained from l by inserting a zero after each element of l. Example: intercale_zeros([4, 17, 12]) is [4, 0, 17, 0, 12, 0].
For this exercise, a list of non-negative numbers will be given, for which the following operation can be done: subtract 1 from two contiguous elements from the list. It must say whether after any number of operations the list can be converted to a list of zeros. EntryThe input will be a list of non-negative integers x_i such that 0 <= x_i <= 2000000000. ". DepartureIf the given list can be converted to a list of zeros with the operation defined above, print "YES", otherwise, print "NO". Examples Input Example 1 1 2Output Example 1 NOT Input Example 2 2 4 2Output Example 2 YES
Write a function MedianWithoutHL(ScoreList) that takes an unsorted list of n numbers as a parameter, discards the highest and the lowest numbers and return the median. You can assume the number of items in the list is between 0.0 and 9.9. To find the median from a list of items, you have tosort the list and find out the value of the item in the middle.Note: If the list has an odd number of items, the median is the value of the middle item. If the list has an even number of items, the median is the average of the two middle items.Sample Run #1:scoreList1 = [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]print("The Original ScoreList: ", scoreList1)print(MedianWithoutHL(scoreList1))Output of Sample Run #1:The Original ScoreList: [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]The List after sorting: [5.0, 6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0, 9.5]Without the High & Low: [6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0]7.75
I am learning C for a class I am taking and a homework assignment asks us to makes a list of integers, divides the list into a number of segments, and displays each segment in reverse order. We need to use the function malloc to dynamically allocate locations for variables a and b. The full assignment is below. I am not too familiar with C and I don't know how to split the list into two arrays.
Write a python function named replaceVal(list, valToBeReplaced, newValue) which takesthe above described inputs and finds the value ‘valToBeReplaced’ in the list. If it ispresent, it is replaced with newValue and the updated list is returned, otherwise thesame list is returned.Example:[1,2,3,4,5], 5, 20Output: [1,2,3,4,20] Example:[10, 15, 20, 25, 30], 5, 20Output: [10, 15, 20, 25, 30]
Write python code 1) Write a function verifsort that accepts a list as a parameter, check if the list elements are sorted and returns: 1 - if the list is sorted in ascending order, 2 – if the list is sorted in descending order, and 0 – if the list is not sorted.

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS