Write the recursive version of the function filter which returns a list and takes in • f - a one-argument function that returns True if the passed in argument should be included in th resulting list or False otherwise ● seq- a list of values Note that this is different from the built in filter function we learned previously, which returns a filter object, not a list. def filter (f, seq): """Filter a sequence to only contain values allowed by filter. >>> def is_even(x): return x % 2 == 0 >>> def divisible_by5(x): return x % 5 == 0 >>> filter (is_even, [1,2,3,4]) [2, 4] >>> filter (divisible_by5, [1, 4, 9, 16, 25, 100]) [25, 100] ... "*** YOUR CODE HERE ***"

Write the recursive version of the function filter which returns a list and takes in • f - a one-argument function that returns True if the passed in argument should be included in th resulting list or False otherwise ● seq- a list of values Note that this is different from the built in filter function we learned previously, which returns a filter object, not a list. def filter (f, seq): """Filter a sequence to only contain values allowed by filter. >>> def is_even(x): return x % 2 == 0 >>> def divisible_by5(x): return x % 5 == 0 >>> filter (is_even, [1,2,3,4]) [2, 4] >>> filter (divisible_by5, [1, 4, 9, 16, 25, 100]) [25, 100] ... "* YOUR CODE HERE *"

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

Exercise B: "Matrix Addition" For this exercise you will design and implement a function that takes two matrix arguments and computes their sum (if and only if a sum can actually be computed, returning an empty list otherwise). Two matrices can only be added together if they have exactly the same dimensions. If the dimensions are acceptable, then the matrix sum will have the same dimensions as either of the operands, and the value of each element in the matrix sum is itself the sum of the corresponding elements in the operand matrices. And although it does makes sense to test rectangularity before attempting addition, you need not perform this step (since you did it above). In order to complete this task, you will need to: ensure you know how matrix addition can be performed² ● Your submission for this exercise:
Write a function named contains-double in Scheme that takes a list as input and returns true if an item every appears twice in a row. You may assume the list is flat (i.e., no nested lists).
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).
Python data structures: write a function that takes in a list (L) as input, and returns the number of inversions. An inversion in L is a pair of elements x and y such that x appears before y in L, but x > y. Your function must run in -place and implement the best possible algoritm of time complexity. def inversions(L: List) -> int:'''finds and returns number of inversions'''
rite a function numPairs that accepts two arguments, a target number and a list of numbers. The function then returns the count of pairs of numbers from the list that sum to the target number. In the first example the answer is 2 because the pairs (0,3) and (1,2) both sum to 3. The pair can be two of the same number, e.g. (2,2) but only if the two 2’s are separate twos in the list.In the last example below, there are three 2’s, so there are three different pairs (2,2) so there are 5 pairs total that sum to 4. Sample usage: >> numPairs( 3, [0,1,2,3] )2
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()
A sequential search of a sorted list can halt when the target is less than a given element in the list. Modify the program to stop when the target becomes less than the current value being compared. In a sorted list, this would indicate that the target is not in the list and searching the remaining values is unnecessary. ----------------------------------------------------------------------------------- """ File: search.py Project 11.1 """ def sequentialSearch(target, lyst): """Returns the position of the target item if found, or -1 otherwise. The lyst is assumed to be sorted in ascending order.""" position = 0 while position < len(lyst): if target == lyst[position]: return position position += 1 return -1 def main(): """Tests with three lists.""" print(sequentialSearch(3, [0, 1, 2, 3, 4])) print(sequentialSearch(3, [0, 1, 2])) # Should stop at second position. print(sequentialSearch(3, [0, 4, 5, 6])) if…
Recursive Max! Write a recursive function rc_max(L:List[int]) -> int that takes a list L and returns an element with highest value in the list. For example, rc_max([1,2,3]) returns 3. Note that L is not necessarily sorted. You may assume that the input L is not empty. You cannot use the built-in max() Your Answer: 1 # Put your answer here 2 Submit
Q3 Racket Number Function Suppose that into the Racket evaluator we enter the definition: (define dozen 12) Give the value of the Racket expression: (number? dozen). Note that the value should be consistent with the Racket language. Enter your answer here Save Answer Q4 Racket Empty Lists Give two ways to write a Racket expression of which the value is a one-element list with the empty list as its element. Enter your answer here Save Answer
Write a function set_elements() that assigns 1 to the last and fifth elements of a list parameter. Ex: If the input is: One man's trash is another man's treasure then the output is: ['One', "man's", 'trash', 'is', 1, "man's", 1] ''' Your code goes here ''' vals_to_update = input().split() set_elements(vals_to_update) print(vals_to_update)
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
Python Help Write a function equals(a,b) that returns true when the two lists a, and b have the same elements in the same order, and false otherwise.Write main() to call the function equals(a,b)