write a function called get_pa S that takes a list of words as input. The unction should return a new list containing every word in the input list that is a palindrome (a palindrome is a word that reads the same forwards and backwards, like "noon" or "eve"). The output list should be a list of tuples, where each tuple consists of a palindrome and its length. NOTE: You must use a list comprehension to solve this exercise. Your function must be defined as a *single line* of code - CodeRunner will count the number of "new lines" inside your function definition, and there must be only one new line (separating the function header from the function body). The code editor below should show only two lines: one for the function header and one for the function body. Delete any blank lines within the function definition and do not add a new line at the end of the function body (i.e. at the end of the return statement)! For example: Test words = ["noon", "bob", "ann"] result = get_palindromes (words) print (result) words = ["civic", "radar", "level", "noone", "redivider", "deified", "rotor"] result = get_palindromes (words) print (result) Result [('noon', 4), ('bob', 3)] [('civic', 5), ('radar',

write a function called get_pa S that takes a list of words as input. The unction should return a new list containing every word in the input list that is a palindrome (a palindrome is a word that reads the same forwards and backwards, like "noon" or "eve"). The output list should be a list of tuples, where each tuple consists of a palindrome and its length. NOTE: You must use a list comprehension to solve this exercise. Your function must be defined as a single line of code - CodeRunner will count the number of "new lines" inside your function definition, and there must be only one new line (separating the function header from the function body). The code editor below should show only two lines: one for the function header and one for the function body. Delete any blank lines within the function definition and do not add a new line at the end of the function body (i.e. at the end of the return statement)! For example: Test words = ["noon", "bob", "ann"] result = get_palindromes (words) print (result) words = ["civic", "radar", "level", "noone", "redivider", "deified", "rotor"] result = get_palindromes (words) print (result) Result [('noon', 4), ('bob', 3)] [('civic', 5), ('radar',

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

Write a function list2DigitOdd() that creates and returns a list that contain all positive 2-digit odd numbers. The function call list2DigitOdd() will return a list containing 11, 13, 15, ..., 99.
Write a function called find_duplicates which accepts one list as a parameter. This function needs to sort through the list passed to it and find values that are duplicated in the list. The duplicated values should be compiled into another list which the function will return. No matter how many times a word is duplicated, it should only be added once to the duplicates list. NB: Only write the function. Do not call it. For example: Test Result random_words = ("remember","snakes","nappy","rough","dusty","judicious","brainy","shop","light","straw","quickest", "adventurous","yielding","grandiose","replace","fat","wipe","happy","brainy","shop","light","straw", "quickest","adventurous","yielding","grandiose","motion","gaudy","precede","medical","park","flowers", "noiseless","blade","hanging","whistle","event","slip") print(find_duplicates(sorted(random_words))) ['adventurous', 'brainy', 'grandiose', 'light', 'quickest', 'shop', 'straw', 'yielding']…
Write a function that accepts two lists as it's only arguments. The function should return a new list containing all the elements of the two list arguments. For example, if the function was passed the lists [1, 2, 3] and [4, 5, 6], it would return a new list containing [1, 2, 3, 4, 5, 6]
Write a higher order function called store_word that takes in a secret word. It will return the length of the secret word and another function, guess_word, that the user can use to try to guess the secret word. Assume that when the user tries to guess the secret word, they will only guess words that are equal in length to the secret word. The user can pass their guess into the guess_word function, and it will return a list where every element in the list is a boolean, True or False, indicating whether the letter at that index matches the letter in the secret word! def store_word(secret): |||||| >>> word_len, guess_word = store_word ("cake") >>> word_len 4 >>> guess_word("corn") [True, False, False, False] >>> guess word("come") [True, False, False, True] >>> guess_word("cake") [True, True, True, True] >>> word_len, guess_word = store_word ("pop") >>> word_len 3 >>> guess_word("ate") [False, False, False] >>> guess_word("top") [False, True, True] >>> guess_word ("pop") [True, True,…
Write a function that will accept a list of numbers and an integer (n). Thefunction should return a list containing every nth item from the input list,always starting with the first item in the list. The original list should notbe modified.For example, if the function is passed the list[8, 3, 19, 26, 32, 12, 3, 7, 21, 16]and the integer 3, it will return the list[8, 26, 3, 16]The function should be general, and work for any list and any positiveinteger value of n.def countByN(myList,n):return myList[::n]
Code in python Given a list, L, the function front_two creates a new list of length 2 out of the first two items in L as follows: In the new list, the second item becomes the first item, and the first item becomes the second. If L contains only one item, the first item in the new list should be the value None. If L is empty, both items in the new list should be value None. The function returns the new list. For example: Test Result L = ['a', 'b', 'c', 'd'] print(front_two(L)) ['b', 'a'] L = [] print(front_two(L)) [None, None] L = [5, 2] print(front_two(L)) [2, 5] L = [7] print(front_two(L)) [None, 7]
Write a function called myunion that will take two lists x and y, and return a list that has the elements of x, followed by the elements of y that are not found in x. For example: (myunion ’(1 3 5 7 9) ’(1 2 3 4 5 6 7)) should return (1 3 5 7 9 2 4 6).
Write a function multiply_ends (nums) that takes a non-empty list of integers and returns the first integer multiplied by the last integer. For example, if nums is the list [5, 4, 6, 2], the function would return 5 * 2 = 10. If the list has only 1 element, the first and last elements are the same so the function should return the square of the element. For example: Test Result print(multiply_ends( [5, 4, 6, 2])) 10 Answer: (penalty regime: 0, 10, 20, ... %) 1 | Precheck Check
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…
Write a function named listReplace that takes 3 arguments: list1, tuple1, and tuple2. The function then searches for entries of tuple1 in list1 and replaces them with the corresponding entries in tuple2 and returns the new list. For example, listReplace( [1,2,3,2,4,1,5], (1,2), (7,8)) will return the following list, replacing all 1s in list1 with 7, and all 2s with 8: [7,8,3,8,4,7,5] Be carefull the following call listReplace( [1,1,1,8,0,0], (1,0), (e,2) ) should return [0,0,0,2,2,2] and not [2,2,2,2,2,2]. Also listReplace ([1,1,1], (0,2), (4,5)) returns the original list, because 0 and 2 do not exist in list1.
Write a function that will accept a list of integers and return the sum of the contents of the list(……if the list contains 1,2,3 it will return 6…..)
Write a function that takes two arguments, a list L1 and a list L2. • If the length of the list L1 is greater than twice the length of the list L2, then append the first three values of L1 to the three last values of L2. E.g. if L1 = ‘(1 2 3 4 5 6 7) and L2 = ‘(8 9 10), then return ‘(1 2 3 8 9 10) Should be written in the Racket programming language