Write a Python script to enter and print the two lists X[10] and Y[10], then find and print the value of Z from the following equation: z = 2 ΣX(t).Y(1) i=0 Then find the following: 1) Sort in descending manner. 2) Print the last two minimum numbers. 3) The value that is greater than 35 and less than 60 and store then in new list P. 4) Split the odd and even numbers in two separated lists named (Z_even, and Z_odd).

Write a Python script to enter and print the two lists X[10] and Y[10], then find and print the value of Z from the following equation: z = 2 ΣX(t).Y(1) i=0 Then find the following: 1) Sort in descending manner. 2) Print the last two minimum numbers. 3) The value that is greater than 35 and less than 60 and store then in new list P. 4) Split the odd and even numbers in two separated lists named (Z_even, and Z_odd).

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

In this Homework, you are going to write a program that implements a sorted list using dynamic allocated arrays. DataFile.txt contains the information of poker cards. 1. C: clubs (lowest), D: diamonds, H: hearts, S: spades (highest) 2. 2 (lowest), 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, A 3. No Joker cards 4. Any C cards are lower than any D cards. DataFile Content (You can write the file specification into your program.): H4, C8, HJ,C9,D10,D5,DK,D2,S7,DJ, H3, H6,S10,HK,DQ,C2,CJ,C4,CQ,D8,C3,SA,S2, HQ, S8, C6,D9,S3,SQ ,C5, S4, H5, SJ,D3, H8,CK,S6,D7,59,H2, CA,C7,H7,DA,D4,H9,D6,HA,H10, S5, C10 H4, D5, HK, D2 H4, HK, SK C9,C10 For examples, DJ means J of Diamonds; H7 means 7 of hearts. Your job 1. Create a list by dynamic allocated array and set the size to 20
**Cenaage Python** Question: 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. CODE: 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 __name__ == "__main__": main()
This is for Python version 3.8.5 and please include pseudocode. nums = [8, 15, 6, 17, 33, 20, 14, 9, 12]Write Python code that: uses a function to print the size of the list named nums uses a function to print the largest number in nums prints the element 14 by using its index makes a slice named subnums containing only 33, 20, and 14
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'''
Language: Python 3 Autocomplete Ready O 4. Pair Of Elements having Smallest Absolute Difference 1 v import ast lst = input() 2 3 lst = ast.literal_eval (lst) 4 Given a list of unsorted integers. Find the pair of elements that have the smallest absolute difference between them. If there are multiple pairs, find them all. 5 6 print(smallest_absdiff_pairs(lst)) Implement a function smallest_absdiff_pairs that take a list of numbers and returns a list of pair of elements that have the smallest absolute difference between them. >>> smallest_absdiff_pairs([5, 4, 3, 2]) [(2, 3), (3, 4), (4, 5)] >>> smallest_absdiff_pairs([-20, -3916237, -357920, -3620601, 7374819, -7330761, 30, 6246457, -6461594, 266854, -520, -470]) [(-520, -470), (-20, 30)] >>> smallest_absdiff_pairs([-20, -3916237, -357920, -3620601, 7374819, -7330761, 30, 6246457, -6461594, 266854]) [(-20, 30)]
Write the following function that partitions the list using the first element, called a pivot:def partition(lst): After the partition, the elements in the list are rearranged so that all the elements before the pivot are less than or equal to the pivot and the element after the pivot are greater than the pivot. The function also returns the index where the pivot is located in the new list. For example, suppose the list is [5, 2, 9, 3, 6, 8]. After the partition, the list becomes [3, 2, 5, 9, 6, 8]. Implement the function in a way that takes len(lst) comparisons. Write a test program that prompts the user to enter a list and displays the list after the partition.
ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1,N2,⋯ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single element completely before inputting the next one. This can be a useful technique when the list is very big (e.g., billions of elements) and there might not be enough memory in the computer to store it in its entirety. Write an algorithm that reads in a sequence of values v≥0, one at a time, and computes the average of all the numbers. You should stop the computation when you input a value of V = −1. Do not include this negative value in your computations; it is not a piece of data but only a marker to identify the end of the list. PLEASE MODIFY THE FOLLOWING CODE SO THE USER INPUTS THE NUMBERS ONE BY ONE: ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1 ,N2,⋯ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single…
Write python code as per below requirement get_first_character(word_list) It will return array of first character in each word in the given list Ex: ['apple', 'banana'] will return ['a', 'b']
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]
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)
Sort the following list using the Selection Sort algorithm . Show the list after each iteration of the outer for loop (after each complete pass through the list) IMPORTANT: Separate each value by a comma and only one space after each comma and no space after the last value. You will have seven iterations of the list for your answer. 38, 60, 43, 5, 70, 58, 15, 10