Create a program that contains a function pairs(x) where x is a list of integers. The function should return (not print) another list which contains numbers from x which have a pair. There may be multiple pairs for the same number. The list to be returned must be sorted. Example test cases • pairs([1, 1, 2, 2, 2, 2, 3, 5, 5]) should return [1, 2, 2, 5] • pairs([9, 8, 9, 8, 1, 1, 2]) should return [1, 8, 9]

Create a program that contains a function pairs(x) where x is a list of integers. The function should return (not print) another list which contains numbers from x which have a pair. There may be multiple pairs for the same number. The list to be returned must be sorted. Example test cases • pairs([1, 1, 2, 2, 2, 2, 3, 5, 5]) should return [1, 2, 2, 5] • pairs([9, 8, 9, 8, 1, 1, 2]) should return [1, 8, 9]

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

please solve B number question with python language
PLZ write in SML language. Thank you Write a function maxGroup that determines, for a given integer list, the stored number of the longest consecutive group of equal numbers. For example, maxGroup [2, 9, 8, 8, 8, 7, 9, 1] should return 8 since there are three consecutive 8s in the list. Hint: Solve the problem in two steps. First, determine the length of each group of equal numbers. Then, determine which is the largest.
Use Python when answering the question: Write a function primeFac that computes the prime factorization of anumber: it accepts a single argument, an integer greater than 1 it returns a list containing the prime factorization each number in the list is a prime number greater than 1 the product of the numbers in the list is the original number the factors are listed in non-decreasing order Output is in the attached picture:
In python We have a list (named data) of numbers sorted in ascending order, for example: data = [2, 4, 5, 9, 10, 12, 13, 17, 18, 20] Write a function (named DataVar(data)), which take a list (data) as input parameter and performs the following steps on the list: 1) it finds the mean m of the data (for the given example, it is m = (2 + 4 + 5 + 9 + 10 + 12 + 13 + 17 + 18 + 20)/10 =110/10 = 11). 2) then, it finds the difference of data and m. Essentially, it finds for all data: Diff = data-m For the given example, Diff = [-9, -7, -6, -2, -1, 1, 2, 6, 7, 9]. 3) then, it finds the sum of Diff and 7. Essentially, it finds for all data: Sums = Diff+7 For the given example, Sums = [-2, 0, 1, 5, 6, 8, 9, 13, 14, 16]. 4) then, it finds the square of all the elements of Sums, such that Squares = square of the elements of Sums. For the given example, Squares = [4, 0, 1, 25, 36, 64, 81, 169, 196, 256]. 5) it finds the average of Squares and stores it in result, and returns it. For the given…
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!
Write a function named 'freq(I)` that takes a list 'I' of numbers and returns a tuple of the most frequent number and its frequency. For example, "freq([1,2,3,4,5,2,3,4,5,3,4,5,4,5,4]) returns (4,5) because number 4 appears 5 times in this list. If multiple numbers appear as most frequent, then the first element of the returned tuple is a list of all those numbers. For example, freq([1,2,3,1,2,1,2,3,1,2]) will return ([1,2], 4) because both 1 and 2 appear 4 times in the list. def freq(l): # remove the following line to solve this question return
python wirte a function max_indexes(xs) that inserts a list xs with numbers and returns a list of indexpositions where the list has local maximum values. A local maximum value is a number in the list that has a smaller number before and after. for example in this list has a local maximum at position 2 and 7: [3, 4, 5, 2, 1, 0, 4, 6, 4, 2, 1] Here the function should return [2, 7]
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()
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
Write a program in Python including the following functions: a) Write a function that takes a list and 2 integers x and y as parameter and performs the following: • If the list has an even number of elements, inserts y number of x's in the middle of the list. • Otherwise, inserts y number of x's to the end of the list • Returns the list. Sample Run: 1st=[2,3,4,5] 1st=fun(1st,9,2) [2, 3, 9, 9, 4, 5] b) Write a function which takes a list of integer digits and an integer as parameter (to store powers of 10) and returns an integer which is composed of the digits in the list. Sample Run: print (form(1st,1)) #for 1st=[2,3,9,9,4,5] 239945 c) Call the first function, and send the returning list to the second function. You do not need to input anything. Note: You can use list functions, but no loops and no type conversion. Recursion is allowed. O
def f(x,v): return -x**3+5*x**2-8*x+4-(v**2)*(2-x) Define v_list = np.linspace(0, 0.5, 6) and write a for loop to iterate over this list to plot the function f(x, v) for each v value in the list Your plot range of x should be between 0.8 and 2.5. Show all the graphs on the same plot; do not do plot a separate plot for each v value. v_list = np.linspace(0, 0.5, 6) x = np.linspace(0.8, 2.5) for v in v_list: plt.plot(v, f(x,v)) plt.xlim(0.8,2.5) plt.show() ı could not find error here?
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).