Assume you have a 2D matrix. Values are sorted in ascending order from left to write and top to bottom, e.g., 1 7 16 21 34 4 9 20 25 41 6. 16 31 33 44 11 19 49 50 61 I'm curious if my value x is in this matrix. I could take a brute force approach, considering all cells via the following code: def find in matrix(m, num rows, num cols, x): for į in range(num rows): for j in range(num cols): if m[i]li)==x: return True return False What would be the big O estimate of the run-time for this brute force approach? How could I take a divide-and-conquer approach? Briefly describe (in words) how you could use what is known about the structure of the 2D matrix to divide and conquer.

Assume you have a 2D matrix. Values are sorted in ascending order from left to write and top to bottom, e.g., 1 7 16 21 34 4 9 20 25 41 6. 16 31 33 44 11 19 49 50 61 I'm curious if my value x is in this matrix. I could take a brute force approach, considering all cells via the following code: def find in matrix(m, num rows, num cols, x): for į in range(num rows): for j in range(num cols): if m[i]li)==x: return True return False What would be the big O estimate of the run-time for this brute force approach? How could I take a divide-and-conquer approach? Briefly describe (in words) how you could use what is known about the structure of the 2D matrix to divide and conquer.

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 PYTHON! Given an n×n matrix A and n×1 right-hand side b, write a function that carries out q iterations of the Gauss elimination outer loop (without pivoting), where q is an integer between 1 and n, and returns the resulting augmented matrix with all below-diagonal elements transformed to zero in the left-most q columns. ##The code format given below may help # def gaussq (A, b, q): '''Apply Gauss elimination (without pivoting) to first q columns of a given linear system Inputs: A, coefficient matrix, size n by n b, vector of constants, n by 1 q, number of columns to apply Gauss elimination to, an integer between 1 and n Output: Aa, augmented matrix with all below-diagonal elements transformed to zero in the left-most q columns, n by n+1 #to check the work
Compute the code that return the matrix M = AT A for a given matrix A - the superscript T denoted the transpose. I have started the code for you, which gets the dimension of the matrix, and creates the zero matrix of the correct size. I have also provided some of the loops involved. : # perform and return the multiplication of $A^TA$ import numpy as np def multiply_At_A(A): # these lines set up the correct dimensions #of the returned matrix. # the matrix A is of dimension diml dim2 - # the matrix A^T (transpose of A) is dim2 x diml # the matrix (A^T A) is of dimension dim2 x dim2 dim1 = A. shape [0] dim2 = A. shape [1] matrix = np.zeros([dim2, dim2]) for i in range (dim2): for j in range (dim2): # complete the final loop to #compute matrix[i,j] # YOUR CODE HERE return matrix
Implement a program that will populate a 6x5 matrix with randomly generated integers from 100 to 500. (1) print your matrix in a table form. (2) modify your code to multiply all odd numbers by 2 and print the matrix. Sample run: Initial Matrix: 145 | 437 | 222 | 101 | 100 | 278 500 | 190 | 415 | 288 | 466 322 377 | 240 | 451 | 331 186 186 432 102 | 106 | 105 249 248 | 117 | 213 | 499 488 355 | 266 | 396 | New Matrix: 290 | 874 | 222 | 101 | 100 | 278 500 | 190 | 830 288 | 466 322 754 | 240 | 902 | 662 186 432 | 102 | 106 | 210| 498 248 | 234 | 426 | 998 488 710 | 266 | 396 |
In Python, generate a random matrix A with 100 entries each of which is an independent numberpseudo-randomly drawn (uniformly) from the interval (0, 1). Let B = A + AT . Use Python to calculatethe diagonal matrix D with the same eigenvalues as B. Then use the QR method to block-diagonalize Bover R. Do at least 100 steps of the QR switching. You should end up with a matrix E which is differentthan D. Answer the question of why.
Compute the code that return the matrix M = AT A for a given matrix A - the superscript T denoted the transpose. I have started the code for you, which gets the dimension of the matrix, and creates the zero matrix of the correct size. I have also provided some of the loops involved. # perform and return the multiplication of $A^TA$ import numpy as np def multiply_At_A(A): # these Lines set up the correct dimensions of the returned matrix. # the matrix A is of dimension dim1 x dim2 - # the matrix A^T (transpose of A) is dim2 x dim1 # the matrix (A^T A) is of dimension dim2 x dim2 dim1= A.shape [0] dim2 = A.shape [1] matrix = np.zeros([dim2, dim2]) for i in range (dim2): for j in range (dim2): # complete the final Loop to compute matrix[i,j] # YOUR CODE HERE return matrix
Consider an n by n matrix, where each of the n2 entries is a positive integer. If the entries in this matrix are unsorted, then determining whether a target number t appears in the matrix can only be done by searching through each of the n2 entries. Thus, any search algorithm has a running time of O(n²). However, suppose you know that this n by n matrix satisfies the following properties: • Integers in each row increase from left to right. • Integers in each column increase from top to bottom. An example of such a matrix is presented below, for n=5. 4 7 11 15 2 5 8 12 19 3 6 9 16 22 10 13 14 17 24 1 18 21 23 | 26 | 30 Here is a bold claim: if the n by n matrix satisfies these two properties, then there exists an O(n) algorithm to determine whether a target number t appears in this matrix. Determine whether this statement is TRUE or FALSE. If the statement is TRUE, describe your algorithm and explain why your algorithm runs in O(n) time. If the statement is FALSE, clearly explain why no…
Write a program that inputs a matrix and displays the trans- pose of that matrix. A transpose of a matrix is obtained by converting all the rows of a given matrix into columns and vice versa.
Compute the code that return the matrix M = AT A for a given matrix A - the superscript T denoted the transpose. I have started the code for you, which gets the dimension of the matrix, and creates the zero matrix of the correct size. I have also provided some of the loops involved. # perform and return the multiplication of $A TAS import numpy as np def multiply_At_A(A): # these lines set up the correct dimensions of the returned matrix. # the matrix A is of dimension dim1 x dim2 - # the matrix A^T (transpose of A) is dim2 x diml # the matrix (A^T A) is of dimension dim2 x dim2 dim1= A.shape [0] dim2 = A.shape [1] matrix = np.zeros( [dim2, dim2]) for i in range (dim2): for j in range (dim2): # complete the fi # YOUR CODE HERE return matrix loop to compute matrix [i,.
Using Floyd's Algorithm 2 compute the values of updated fields in matrices D5 and P5, using given intermediate matrices D4 and P4. You don't need to print the whole matrix, just submit updated fields. Like, for example, print only (D8)12 = 4, P8)12 = 1 and so on D4 v1 v2 v3 v4 v5 v6 v7 V1 v2 3 0 v3 v4 v5 0 4 37 22 24 10 27 v6 9 6 0 24 26 19 29 8 5 33 18 20 13 23 00 9 6 12 1 8 15 0 00 v7 16 13 23 00 8 2 18 5 0 19 00 0 10 26 6 10 0 P4 V1 v2 v3 v1 v2 v3 v4 v5 v6 2 2 4 v7 4 4 4 4 4 4 v4 v5 v6 v7 2 4 4 2 4 1 2 2 4 4 4 4 4 4 4
4x1+4x2+6x3+9x4=03x1+3x5=26x2+5x4+7x5=-46x1+8x4+2x5=54x5+7x2+6x3+8x1=-10Represent the set of equations in a matrix equation, Ax=b, where A is a square matrix and x and b are column vectors. Write the line of code to define matrix A for this problem matlab/octave language
Compute the code that return the matrix M = A" A for a given matrix A - the superscrupt T denoted the transpose. I have started the code for you, which gets the dimension of the matrix, and creates the zero matrix of the correct size. I have also provided some of the loops involved. In [ ]: # perform and return the multiplication of $A^TA$ import numpy as np def multiply_At_A(A): # these lines set up the correct dimensions of the returned matrix. # the matrix A is of dimension diml x dim2 # the matrix A^T (transpose of A) is dim2 x diml # the matrix (A^T A) is of dimension dim2 x dim2 diml = A.shape[0] A.shape[1] = np.zeros ([dim2,dim2]) dim2 matrix for i in range(dim2) : for j in range(dim2) : # complete the final loop to compute matrix[i,j] # your code here return matrix
Write a Program to find the transpose of a given matrix and display its time complexity. by using java