Define a function named get_unique_sorted (list1, list2) that takes two integer lists as parameters. The function combines the values from the two parameter lists and produces a new list that is sorted and contains no duplicates. For example: Test Result list1 = [3, 5, 1, -4, 2] list2 = [1, 7, -2, 6, 9] [3, 5, 1, -4, 2] [1, 7, -2, 6, 9] [-4, -2, 1, 2, 3, 5, 6, 7, 9] list3 = get_unique_sorted(list1, list2) print (list1, list2, list3) listi = (13, -5, 14] [13, -5, 14] [38, 14, -2] [-5, -2, 13, 14, 38] list2 = [38, 14, -2] list3 = get_unique_sorted (list1, list2) print(list1, list2, list3)

Define a function named get_unique_sorted (list1, list2) that takes two integer lists as parameters. The function combines the values from the two parameter lists and produces a new list that is sorted and contains no duplicates. For example: Test Result list1 = [3, 5, 1, -4, 2] list2 = [1, 7, -2, 6, 9] [3, 5, 1, -4, 2] [1, 7, -2, 6, 9] [-4, -2, 1, 2, 3, 5, 6, 7, 9] list3 = get_unique_sorted(list1, list2) print (list1, list2, list3) listi = (13, -5, 14] [13, -5, 14] [38, 14, -2] [-5, -2, 13, 14, 38] list2 = [38, 14, -2] list3 = get_unique_sorted (list1, list2) print(list1, list2, list3)

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

2
Write the following function that sorts and merges two lists into a new sorted list. The new list contains only even numbers. def myMergeEvenList(list1, list2): Enter list1: 10,5,6,7 Enter list2: 12,8,5,0,1 The merged list is: 0,6,8,10,12
QUESTION 4 in phython language Write a program that creates a list of N elements (Hint: use append() function), swaps the first and the last element and prints the list on the screen. N should be a dynamic number entered by the user. Sample output: How many numbers would you like to enter?: 5 Enter a number: 34 Enter a number: 67 Enter a number: 23 Enter a number: 90 Enter a number: 12 The list is: [12, 67,23, 90, 34]
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']…
write the following program using simply linked list in C++ language Add definition of the following functions into a simply linked list: 1) Insert before tail : Insert a value into a simply linked list, such that it's location will be before tail. So if a list contains {1, 2, 3}, insert before tail value 9 is called, the list will become {1, 2, 9, 3}. 2) Insert before value : Insert a value into a simply linked list, such that it's location will be before a particular value. So if a list contains {1, 2, 3}, insert before 2 value 9 is called, the list will become {1, 9, 2, 3}. 3)Count common elements : Count common values between two simply linked lists. So if a list1 contains {1, 2, 3, 4, 5}, and list2 contains {1, 3, 4, 6}, number of common elements is 3. 4) Check if sorted : Check if elements of simply linked lists are sorted in ascending order or not. So if a list contains {1, 3, 7, 8, 9} its sorted, but if a list contains {1, 3, 7, 2, 5} its not sorted. 5) Find…
Add the following functions and write a program to test these functions in the class linkedListType: a. Write the definition of a function that returns the data of the kth element of the linked list. If such element is not exist in the list, exit the program. b. Write the definition of a function that deletes the kth element of the linked list. If such element does not exist in the list, exit the program and display message as output.
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
In OCaml Programming Language, write a function: val prime_separator : int list -> int list * int list = <fun> that takes an integer list as an input, and returns a pair of integer lists where the prime numbers are in the first while the composite numbers are in the second returned list. #prime_separator [1; 2; 3; 4; 5; 6; 7; 8; 9; 10; 11];; - : int list * int list = ([11; 7; 5; 3; 2], [10; 9; 8; 6; 4; 1])
Replace XXX in the following function header for a doubly-linked list: ListInsertAfter(listName, currentNode, XXX) Group of answer choices headNode tailNode middleNode newNode
In python
write the following program using simply linked list in C++ language Add definition of the following functions into a simply linked list: 1) Insert before tail : Insert a value into a simply linked list, such that it's location will be before tail. So if a list contains {1, 2, 3}, insert before tail value 9 is called, the list will become {1, 2, 9, 3}. 2) Insert before value : Insert a value into a simply linked list, such that it's location will be before a particular value. So if a list contains {1, 2, 3}, insert before 2 value 9 is called, the list will become {1, 9, 2, 3}. 3)Count common elements : Count common values between two simply linked lists. So if a list1 contains {1, 2, 3, 4, 5}, and list2 contains {1, 3, 4, 6}, number of common elements is 3. 4) Check if sorted : Check if elements of simply linked lists are sorted in ascending order or not. So if a list contains {1, 3, 7, 8, 9} its sorted, but if a list contains {1, 3, 7, 2, 5} its not sorted. 5) Find…