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

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 and the input should be given by user. For Example: If we call the function with [“dad”, “aunt”, “mom”, “sister”, “mom”] as its user input, the returned value should be [“dad”, “aunt”, “mom”, “sister”]. The order of the items inside the returned list does not matter.
Python Write a function that takes as a parameter a list of strings and returns a list containing the lengths of each of the strings. That is, if the input parameter is ["apple pie", "brownies","chocolate","dulce de leche","eclairs"], your function should return [9, 8, 9, 14, 7]. The file you submit should include a main() function that demonstrates that your function works. The list that is the input argument can be a hard-coded one like the one shown above or you could ask the user to input a string and split on the appropriate delimiter, creating a list. Hint: This problem can be approached as an "accumulator", where we accumulate lists:
Write a function is Prime (a_nNum) that takes a positive integer as an argument and returns True if the argument is a prime number, or False otherwise. A prime number is a number that is only evenly divisible by itself and 1. Then, write a function listOfPrimes (a_nSize) that takes a number as an argument and returns a list of the first a_nSize prime numbers. Use the previously defined is Prime (a_nNum). Finally, test your function listof Primes (a_nSize). Hint: Recall that the operator divides one number by another and returns the remainder of the division. Example: listOfPrimes (10) returns [2, 3, 5, 7, 11, 13, 17, 19, 23, 29).
Write a function find_plateaus that receives a list of integers as parameters.Your function should find and return a list of plateaus, which are numbers that are equal to both of its neighbors. IMPORTANT NOTES: the first and last values can not be plateaus; the plateaus should be in the order they appear in the original list; the same value might be a plateau in multiple places in the original list; there might be no plateaus, in which case you should simply return an empty list. Example 1:If the function call is: find_plateaus([1, 2, 2, 2, 1]) You should return [2], because: 2 == 2 and 2 == 2. Example 2:If the function call is: find_plateaus([10, 2, 20, 4, 4, 4, 5, 8, 5, 5, 5, 5]) You should return [4, 5, 5], because: 4 == 4 and 4 == 4; 5 == 5 and 5 == 5; 5 == 5 and 5 == 5
8. Write a function called starts_with that takes as parameter a list of strings called words and returns a dictionary containing the number of words starting with each first letter found in the list. You can assume the strings are all lowercase and that there will be no empty strings. Use a loop. starts_with([)) starts_with(['nebula']) {'n': 1) starts_with(['one', fish', 'two', 'fish']) (t': 2, 'o': 1, t': 1) starts_with(['she', 'sells', 'seashells', 'by', 'the', 'seashore']) {'s': 4, 'b': 1 't: 1)
C++ I'm interested in knowing if there are two adjacent strings in a list that are very similar to each other. For instance, "Zach" and "Zack" are only one character apart. Write a function, named "CloseEnough" that takes a const reference to a vector of strings and an int. The vector is a list of strings (each of the same length). The int represents how many characters can be different between any two strings next to each other. This function should return the index (an int) of the string that is within the second arguments distance to the next string in the vector. If no index fulfills this criteria, it should return -1. You should be using the STL algorithms to achieve this and no while or for loops.
3. Define a function in Python that takes a list as the parameter and returns True if the list contains a 2-digit positive number. Otherwise, the function should return False.
Write a function sum_and_print(nums) that takes a non-empty list of integers nums as a parameter and prints a series of partial sums in the format shown in the table below. The first line of output shows just the first number, the second shows the first number plus the second, the third shows the sum of the first three numbers, and so on. For example: Test Result sum_and_print([3, 1, 2, 0, 4]) Total up to i = 0: 3 Total up to i = 1: 4 Total up to i = 2: 6 Total up to i = 3: 6 Total up to i = 4: 10 sum_and_print( [333]) Total up to i = 0: 333
iii. Add a function named lowercase() to this program that takes a list of uppercase letters as a parameter (e.g., x). This function must convert each uppercase letter in x to lowercase and return the list. Your function must use the ord() and chr() functions to solve this problem. You must NOT use the built-in lower() method. Hint: for any letter, the difference between its lowercase and uppercase ASCII values is 32. For example, ASCII values of 'a' and 'A' are 97 and 65, respectively; ASCII values of 'z' and 'Z' are 122 and 90, respectively.
In F# (F sharp) Write an function findMatches that takes a string and a list of tuples as arguments. Each element of the list will be a tuple consisting of a string and an int. Find all of the tuples for which the string matches the first argument and collect all of the corresponding integers. Your final result should be the collected integers sorted in ascending order. For example, if the string argument is "A" and the list is [("A",5); ("BB",6); ("AA",9); ("A",0)], your function should return the list [0;5]. You may use the List.sort function to produce your final result. Important: Do not use F# system functions or methods (such as map, max or filter, etc). Examples in F# Interactive: > findMatches "A" [("A",5); ("BB",6); ("AA",9); ("A",0)];;val it : int list = [0; 5]> findMatches "BB" [("A",5); ("BB",6); ("AA",9); ("A",0)];;val it : int list = [6]> findMatches "X" [("A",5); ("BB",6); ("AA",9); ("A",0)];;val it : int list = []> findMatches "A" [];;val it : int list = []…
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
4. Modify the bracketsBalance function so that the caller can supply the brackets to match as arguments to this function. The second argument should be a list of beginning brackets, and the third argument should be a list of ending brackets. The pairs of brackets at each position in the two lists should match; that is, position 0 in the two lists might have [ and], respectively. You should be able to modify the code for the function so that it does not reference literal bracket symbols, but just uses the list arguments. (Hint: The method index returns the position of an item in a list.) the bracketsBalance function: def bracketsBalance(exp):"""exp is a string that represents the expression""" stk = LinkedStack() for ch in exp: if ch in [’[’, ’(’]: stk.push(ch) elif ch in [’]’, ’)’]: if stk.isEmpty(): # Create a new stack # Scan across the expression # Push an opening bracket # Process a closing bracket# Not balanced return FalsechFromStack = stk.pop()# Brackets must be of…