Write a function called find_máx tha index of the row that sums to the greatest value. For example, if you had the following list of lists: list [[1, 2, 3], [2, 3, 3), [1, 3, 3]] The first row would be 6, the second 8 and the third 7. The function would therefore retorn 1 (the %3D index of the second row). Your program should get the number of rows, number of columns, and the values of the list of lists from user input. You can assume the list of lists has at least one row and one column. You can not use built-in sum unction. Print the list of lists and the index of the row that sums to the greatest value. lote: for indentation, use 5 spaces instead of Tab.

Write a function called find_máx tha index of the row that sums to the greatest value. For example, if you had the following list of lists: list [[1, 2, 3], [2, 3, 3), [1, 3, 3]] The first row would be 6, the second 8 and the third 7. The function would therefore retorn 1 (the %3D index of the second row). Your program should get the number of rows, number of columns, and the values of the list of lists from user input. You can assume the list of lists has at least one row and one column. You can not use built-in sum unction. Print the list of lists and the index of the row that sums to the greatest value. lote: for indentation, use 5 spaces instead of Tab.

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 answer it in Python Write a function insere_milieu that takes as an argument a list l and an element elem and returns the list obtained from l by adding elem "in the middle" of l, that is: If the length of l is even, the item is added once, in the middle of the list. If the length of l is odd: the element is added on either side of the central element. Example: insere_milieu([4, 7, 12, 3], 0) is [4, 7, 0, 12,3] insere_milieu([9, 3, 5, 6, 2], 1) is [9, 3, 1, 5, 1, 6, 2].
Write a function countBottom() that takes a list as parameter, finds and returns the number of bottom values in the list.A bottom value is less than its predecessor and its successor.Assume that the list contains numbers.Example: [4, 2, 3, 7, 6, 6, 4, 3, 5, 8, 6, 7, 5] has 3 bottoms, the first 2, the second 3, and last 6. All these values are less than their predecessor and their successor. can u use pyhton and pls fast answer=)
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
Write a program in python with a function isPal(L), where L is a list of integers, and the function returns True if the list is a palindrome, False otherwise. For example [5, 2, 9, 9, 2 5] is a palindrome. Use the reverse() method of list and check if the reversed list is the same as the original list.
Write a program in PYTHON with a function longest(L) which examines the argument list L and returns the longest string. You can assume all of the elements of the list L are strings, and that the list is not empty. Use the approach where there is a variable largestyet which is initialized to the first element of L. Then go through the rest of the elements and update largestyet whenever you encounter a longer string. For example, longest(['blue', 'red', 'the old barn', 'the white house', 'green']) would return 'the white house'.
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 Python function peaksIndex() that takes a list as parameter, returns a list that contains the indexes of peak values in the list.A peak value is greater than its predecessor and its successor.Assume that the list contains numbers.Example: [4, 2, 5, 7, 6, 6, 4, 3, 5, 2, 6, 7] has 2 peaks, the first 7 (index 3) and the second 5 (index 8). Both of these values are greater than their predecessor and their successor. So the function will return [3, 8] for this list.Write only the answer of what is asked. Unnecessary statements may result in loss of points.
Write a Python function peaksIndex() that takes a list as parameter, returns a list that contains the indexes of peak values in the list.A peak value is greater than its predecessor and its successor.Assume that the list contains numbers.Example: [4, 2, 5, 7, 6, 6, 4, 3, 5, 2, 6, 7] has 2 peaks, the first 7 (index 3) and the second 5 (index 8). Both of these values are greater than their predecessor and their successor. So the function will return [3, 8] for this list.Write only the answer of what is asked.
Write a program in PYTHON with a function max(L) which examines the argument list L, and returns the largest object of type float. If there is no float object in the list, then the function returns None. For example,max([100, 'blue', 3.5, 'sugar on the rocks', 7.0]) would return 7.0, andmax([7, 2, 9, 1]) would return None. Note that type(element) == float is a way to check if element is a float
In python, remove_from_list(my_list, indices): Takes two lists as input. Creates a new list from the first input list by removing the elements at indices given by the integers in the second input list, then return the new list. The indices in the second input list may have any order. For example, if the first input list is [4, 8, 12, 16], and the second input list is [0, 2], then the new list returned from the function should have the 4 and the 12 removed, because they were at indices 0 and 2 of the original list. Note: You do not need to consider negative indices for this function. >>> remove_from_list(['abc', 'def', 'ghi'], [1]) ['abc', 'ghi'] >>> strs = ['The', 'quick', 'brown', 'fox'] >>> remove_from_list(strs, [0, 3]) ['quick', 'brown'] >>> strs ['The', 'quick', 'brown', 'fox'] # original list is unchanged >>> remove_from_list(['The', 'quick', 'brown', 'fox'], [3, 0]) ['quick', 'brown']
Write a function sum67 that takes a list as an input parameter and returns the sum of the numbers in the list, except ignore sections of numbers starting with a 6 and extending to the next 7 (every 6 will be followed by at least one 7). Return 0 for no numbers.
Write a function that takes three lists of integers, l1, l2, and l3, and returnsa list of all tuples, where each tuple (a,b,c) is such that a is from l1, b is from l2 and c is from l3 and a+b=c. For example, given [1,2,3], [4,5] and [7,8]you should return [(2,5,7), (3,4,7), (3,5,8)]. The returned list must be sortedaccording to a and b, in ascending order.