Question 1: Adding matrices Write a function that adds two matrices together using list comprehensions. The function should take in two 2D lists of the same dimensions. Try to implement this in one line! def add_matrices (x, y): HHH >>> matrix1 = [[1, 3], [2, 0]] >>> matrix2 = [[-3, 0], [1, 2]] >>>add_matrices (matrix1, matrix2) [[-2, 3], [3, 2]] ... ... >>> matrix4 = [[ 1, -2, 3], [-4, 5, -6]] >>> matrix5 = [[-1, 2, -3], [4, -5, 6]] ... >>>add_matrices (matrix4, matrix5) [[0, 0, 0], [0, 0, 0]] H "*** YOUR CODE HERE ***"

Question 1: Adding matrices Write a function that adds two matrices together using list comprehensions. The function should take in two 2D lists of the same dimensions. Try to implement this in one line! def add_matrices (x, y): HHH >>> matrix1 = [[1, 3], [2, 0]] >>> matrix2 = [[-3, 0], [1, 2]] >>>add_matrices (matrix1, matrix2) [[-2, 3], [3, 2]] ... ... >>> matrix4 = [[ 1, -2, 3], [-4, 5, -6]] >>> matrix5 = [[-1, 2, -3], [4, -5, 6]] ... >>>add_matrices (matrix4, matrix5) [[0, 0, 0], [0, 0, 0]] H "* 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

Write a function sum_alt that takes a list of numbers zand calculates their alternating sum, defined as n-1 Σ(-1)+1 zk. k=0 Here Zo, Z1, Zn-1 denote the individual elements of the list.
Write a function that shuffles the rows in a two-dimensional list using the following header:def shuffle(m):Write a test program that shuffles the following matrix:m = [[1, 2], [3, 4], [5, 6], [7, 8], [9, 10]]
Exercise G -- Implement a function halves that takes a list of integers and divides each element of the list by two (using the integer division operator //) NOTE use the map function combined with a lambda expression to do the division with a neat solution halves : List Int -> List Int halves xs = [ ] --remove this line and implement your halves function here
F# Explain in detail what this function does and what the result is. let ip L1 L2 = List.map2 (*) L1 L2 |> List.sum printfn "%A" (ip [1;2;3][4;5;6]) %3D whn
def large_matrix(matrix: list[list[int]]) -> int:"""Returns the area of the rectangle in the area of a rectangle is defined by number of 1's that it contains.The matrix will only contain the integers 1 and 0.>>> case = [[1, 0, 1, 0, 0],... [1, 0, 1, 1, 1],... [1, 1, 1, 1, 1],... [1, 0, 0, 1, 0]]>>> largest_in_matrix(case1)6"" You must use this helper code: def large_position(matrix: list[list[int]], row: int, col: int) -> int: a = rowb = colmax = 0temp = 0rows = len(matrix)column = len(matrix[a])while a < rows and matrix[a][col] == 1:temp = 0while b < column and matrix[a][b] == 1:temp = temp + 1b = b + 1column = ba = a + 1if (a != row+1):temp2 = temp * (a - row)else:temp2 = tempif max < temp2:max = temp2b = colreturn max """ remember: Please do this on python you should not use any of the following: dictionaries or dictionary methods try-except break and continue statements recursion map / filter import""'
EXERCISE 1 Consider a function doubles :: Cint]Eint] that doubles every item in list doubles [3, 4,1,2] [6,8, 2,4] a) write a version doubles Rec using recursion for the aboe function
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'''
In Python: Create a function Matrix_transpose() utilizing List comprehension techniques that takes a 2d list containing user generated/input elements of type int as its argument then returns the reference to a new 2d list that is the transpose of the original. Assume the matrix is rectangular. Show the funtion works with different values. Do not use any python packages to create the funtion.
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 code Screenshot and code is must
Java language plz
Exercise 4 Write a function called chop that takes a list, modifies it by removing the first and last elements, and returns None. For example: >>> t = [1, 2, 3, 4] >>> chop(t) >>> t [2, 3]