Please write a function named shortest, which takes a list of strings as its argument. The function returns whichever of the strings is the shortest. If more than one are equally short, the function can return any of the shortest strings (there will be no such situation in the tests). You may assume there will be no empty strings in the list. my_list = ["first", "second", "fourth", "eleventh"] result shortest (my_list) print (result) my_list = ["adele", "mark", "dorothy", "tim", "hedy", "richard"] result shortest (my_list) print (result) first tim Sample output

Please write a function named shortest, which takes a list of strings as its argument. The function returns whichever of the strings is the shortest. If more than one are equally short, the function can return any of the shortest strings (there will be no such situation in the tests). You may assume there will be no empty strings in the list. my_list = ["first", "second", "fourth", "eleventh"] result shortest (my_list) print (result) my_list = ["adele", "mark", "dorothy", "tim", "hedy", "richard"] result shortest (my_list) print (result) first tim Sample output

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.
The function count_contains_og in python takes a list of strings and returns how many strings in the list contain 'og' / 'OG' / 'oG' / 'Og' (check for 'og', ignoring case). Hint: Use the sequence membership operator in to help you check for 'og' in the individual strings. Create a lower-cased version of the string (lower), then use the in operator. For example: Test Result str_list = ['cat', 'dog', 'FROG', 'monkey'] print(count_contains_og(str_list)) 2 strlist = ["X", "x"] print(count_contains_og(strlist)) 0 list_of_one_og = ["Doggie"] print(count_contains_og(list_of_one_og)) 1
Create a function called find_big_words . The function should accept a list as a parameter. Parts of the program which you are not coding will call the function and past it lists of words. The function must analyze the words in the list and return all the words which are 6 or more characters long. The returned list should be in alphabetical order. NB: Only write the function. Do not call it. For example: Test Result random_words1 = find_big_words(["nation", "night", "news", "negotiation", "newspaper", "nature"]) print(random_words1) ['negotiation', 'newspaper'] random_words3 = find_big_words(["examination","test", "testing", "quiz", "exam", "assessment"]) print(random_words3) ['assessment', 'examination', 'testing']
Write a function called count_superheroes () that takes a list (containing the strings 'Spiderman' and 'Hulk') as a parameter and returns the string 'Spiderman' if Spiderman appears more times in the list than the Hulk; returns the string 'Hulk' if the Hulk appears more times in the list than Spiderman; and returns 'even' otherwise. You MUST use a loop in your solution. You must not use string methods or list methods in your solution. If you didn't complete part a), you may assume that you did in order to answer this question. For example: If the list being passed as an argument to function count_superheroes () is: superheros ['Spiderman', 'Hulk', 'Spiderman', 'Hulk', 'Spiderman', 'Spiderman', 'Hulk'] the function will return the string 'Spiderman' (i.e. the string 'Spiderman' appears in the list more times than the 'Hulk'). =
The function should be written in python language. Write a function called "zero_triples" to return all triples in a list of integers that sum to zero. You can assume the list won't contain any duplicates, and a triple should not use the same number more than once. [In]: zero_triples([1, 2, 4]) [Out]: [] [In]: zero_triples([-3, 1, 4, 2]) [Out]: [[1, 2, -3]] [In]: zero_triples([-9, 1, -3, 2, 4, 5, -4, -1]) [Out]: [[-9, 4, 5], [1, -3, 2], [-3, 4, -1], [5, -4, -1]]
In python, The function count_contains_x takes a list of strings (wordList) and returns the count of how many strings in the list contain at least one upper- or lower-case 'x'. Hint: Use the accumulator pattern to accumulate the count. Hint: You might want to use the string method count. For example: Test Result strlist = ["xerox", "OXEN", "whiffleball", "XOXOX"] print(count_contains_x(strlist)) 3 fish = ["angel", "gold", "cat", "puffer", "damsel"] print(count_contains_x(fish)) 0 strlist = ["X", "x"] print(count_contains_x(strlist)) 2 list_of_one_x = ["x"] print(count_contains_x(list_of_one_x)) 1
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']…
The function makeRandomList creates and returns a list of numbers of a given size(its argument). The numbers in the list are unique and range from 1 through thesize. They are placed in random order. Here is the code for the function:def makeRandomList(size):lyst = []for count in range(size):while True:number = random.randint(1, size)if not number in lyst:lyst.append(number)breakreturn lystYou can assume that range, randint, and append are constant time functions. Youcan also assume that random.randint more rarely returns duplicate numbers as therange between its arguments increases. State the computational complexity of thisfunction using big-O notation, and justify your answer. Only analytical work is required
The function that will a single items to the list is Oextend (...) Oadd(...) Oappend(...) Olengthen(...)
In Python Use the Design Recipe to write a function has_duplicates, which consumes a list and returns True if the list has any duplicate entries, False otherwise. Your function should return False if the list is empty
listAverage() returns the average number in a list. Which of these functions does this correctly?
Given both a list x and a tuple y, write a function called sum_list_andOr_tuple that sums all the elements of both data structures and returns the sum. There is also an optional boolean argument into the function called separate which, if True, causes the function to return the sum of the list and the tuple separately (returns two values); separate is False by default. Please note that the function DOES NOT print anything - it only returns a value(s). See the sample output below: >>> my_list = [0, 9, 99]>>> my_tuple = (8, 12)>>> result = sum_list_andOr_tuple(my_list, my_tuple)>>> print(result) Output: 128>>> result = sum_list_andOr_tuple(my_list, my_tuple, separate = True)>>> print(result) Output: 108, 20