a. Write a function starting_A that takes a list of strings called words as aparameter, and returns a new list of those strings which begin exactlywith"A". Note that the list can containgempty strings.Example:If the list of string is: [ 'Apple',the function should return a new list: ['Apple', 'Amber']'Banana', 'ants', 'Amber'],Write a testing program to test the function from part a. The program shouldask the user for a sentence/string where words are separated by commas. Asample of expected input "Apple, ,Banana, ants, Amber"...+ vtIUAf starting_A (string):for word in string:

Hi. As you have not mentioned any programming language, I will attempt it using Python. Let's…

Write a function starting_A that takes a list of strings called words as a parameter, and returns a new list of those strings which begin exactly with"A". Note that the list can containgempty strings.

Write a function starting_A that takes a list of strings called words as a parameter, and returns a new list of those strings which begin exactly with"A". Note that the list can containgempty strings.

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 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']…
1.Given the argument passed to the function is a list containing integer values, what does the function return def mystery1(someListOfValues: list):total = 0for value in someListOfValues:total += valuereturn total/len(someListOfValues) 2. The function below is to find the largest value in a list passed by parameter. Does it work as intened (yes or no)? If not give an example of an argument it would not work for. def maxValue(someListOfValues:list):"""returns the largest value the list passed by parameter"""value = 0for num in someListOfValues:if num > value:value = numreturn value 3.Write a function called loadNames() that will open a file called names.txt and build a list of its contents and return it. Function Call: names = loadNames()print(names) Sample ouput: ['Nolan Rafaj\n', 'Brandon Brzuszkiewicz\n', 'Amanda Vozari\n', 'Chase Harper\n', 'Bryce Conner']
Programming language is latest version of python
Making a list of numbers from 2 to n Create a function named make-2-n-list that takes in one parameter, the end number. It should return a list of numbers from 2 to that number.(make-2-n-list 30) ➔(2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 1718 19 20 21 22 23 24 25 26 27 28 29 30) Hint: make a function that makes the list backwards (easy right-fold pattern), then look at your recursive case and think backwards. Pls use scheme(R5RS) to finish this program!Thank you a lot!
Part I Implementation In this part you are asked to write functions with python . Define a two dimensional list with NxN elements. This list should be filled with random numbers between 100 and 200. . Write a function that takes a table as a parameter and prints list elements with table shape • Write a function that takes a table as a parameter and return a list that holds diagonal (left-top corner to bottom-right) elements. Write a function that takes a table as a parameter and returns number of all odd numbers in the table Note: You are not allowed to use Numpy package. Part II Test
Complete the reverse_list() function that returns a new string list containing all contents in the parameter but in reverse order. Ex: If the input list is: ['a', 'b', 'c'] then the returned list will be: ['c', 'b', 'a'] Note: Use a for loop. DO NOT use reverse() or reversed(). This is my code so far: def reverse_list(letters): for x in (letters): letters.sort(reverse=True) return lettersif __name__ == '__main__': ch = ['a', 'b', 'c'] print(reverse_list(ch)) # Should print ['c', 'b', 'a'] When submitting I get 4/10 and it says: Test input list ['a', 'b', 'c'] returns ['c', 'b', 'a'] Your output reverse_list() function reversed array incorrectly: ['c', 'b', 'a'] reverse_list() function should have returned: ['a', 'b', 'c'] Test input list ['a', 'b', 'c', 'd'], first element of returned list is ['d'] Your output First character of returned array should be a instead of d Test empty input array TypeError: object of type 'NoneType' has no len()
this code should be in python: write a function that receives a list as its only parameter. Inside the function remove all the duplicate items from the list and returns a new list. For Example: If we call the function with [“dad”, “aunt”, “mom”, “sister”, “mom”] as its input, the returned value should be [“dad”, “aunt”, “mom”, “sister”]. The order of the items inside the returned list does not matter.
Write a function called `filler(A, l)` that takes an integer `A`, and a list of integers `l` and if some of the numbers in `l` sum up to `A` then it returns a list of these numbers. Otherwise, it returns `None`. For example, filler(5, [1,6,3,4]) returns [1,4]. filler(5, [1,6,3,7]) returns None. filler(0, [-1,-1,2,-3]) returns [-1,-1,2]. filler(10, [2,3,2,3,1]) returns [2,3,2,3]. If there are multiple answers, then return any of them. You can use each number in the list once for each occurence. """ def filler(A, l): # remove the following line to solve this question return
DO IT IN PYTHON
CLO3: Analyze the given function below that takes a binary list of size (n) and returns the number of 1's, O's and sum of 1's in the list. Answer the questions below: def function(List): zeroCount = 0 oneCount = 0 onesSum=0 for i in range(len(List)): if Listfi) - 0: zeroCount +=1 else: oneCount += 1 onesSum += 1 print ('Number of Zeros =', zeroCount) print ('Number of Ones =, oneCount) print ('Sum of Ones =', onesSum) 1. Count the number of steps required by the function in terms of n? (" 2. What is the time complexity of the algorithm. (1. 3. Find number of operations if (n = 20).