IMPORTANT: For part 3, implement an iterative dynamic programming solution. You are driving from Canada to Mexico and you are trying to decide the route you want to take. The grid of possible routes you can take is represented by a nxn matrix of integers (List[List[Integer]]). Each integer in the matrix represents the amount you would have to pay in tolls at that location. You can start from any of the locations in the top (0th) row, and your goal is to get to any of the locations in the bottom row. You can only move down one row at a time, in three directions (directly below, or below and diagonally left/right). Specifically the next element from position (row, col) must be one of the following: (row + 1, col), (row + 1, col + 1), (row + 1, col - 1) Return the minimum amount of tolls you will have to pay. For part 3, implement an iterative dynamic programming solution. Input Format One Parameter • toll_matrix: A n xn matrix of integers, where each integer represents the amount of tolls you would have to pay if you pass through that location.

IMPORTANT: For part 3, implement an iterative dynamic programming solution. You are driving from Canada to Mexico and you are trying to decide the route you want to take. The grid of possible routes you can take is represented by a nxn matrix of integers (List[List[Integer]]). Each integer in the matrix represents the amount you would have to pay in tolls at that location. You can start from any of the locations in the top (0th) row, and your goal is to get to any of the locations in the bottom row. You can only move down one row at a time, in three directions (directly below, or below and diagonally left/right). Specifically the next element from position (row, col) must be one of the following: (row + 1, col), (row + 1, col + 1), (row + 1, col - 1) Return the minimum amount of tolls you will have to pay. For part 3, implement an iterative dynamic programming solution. Input Format One Parameter • toll_matrix: A n xn matrix of integers, where each integer represents the amount of tolls you would have to pay if you pass through that location.

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

Using Java Modify the program 1 in guided activity 3 to compute the multiplication of two vectors with the sizes 1xn and nx1. The result is a number (one element matrix) computed as the sum of the products of the corresponding elements from the first vector with the ones from the second vector: m1[0][0]m2[0][0]+m1[0][1]*m2[1][0]+...+m1[0][n-1]m2[n-1][0
In a company, there are several branches. Let us consider a branch of that company having N employees, if the manager is allotted to that branch(s) then he is known to everyone else in that branch. Note that the property of "known to everyone" is unique to a manager. Your task is to find the manager in that branch. Input from the user in main ( ), the square matrix M where if an element of row i and column j is set to 1 it means that ith person knows jth person. You need to write a function managerId ( ) which returns the id of the manager if present or else returns -1. The function managerId ( ) takes two arguments - the square matrix of N *N and its size N. Call managerId ( ) from the main ( ) output the information about the manager. Assume all diagonal elements to be 1 (as everyone knows him/herself) and there is at most one manager in the company.
A matrix is an array of numbers of size m by n (i.e., m x n). When we multiply 2 matrices, we multiply the matching numbers, then sum them up. Multiplying a matrix of size m x n with another matrix of size n x q will result in a matrix of size m x q. An example is shown in Figure 1: [ ? ? ? ? ? ? ] x [ ? ? ? ? ] = [ ?? +?? ?? + ?? ?? + ?? ?? + ?? ?? + ?? ?? + ?? ] Matrix 3 x 2 Matrix 2 x 2 Matrix 3 x 2 Figure 1: Multiplication of Matrix 3 x 2 and 2 x 2 Write a C++ program that multiplies 2 matrices and return the sum of the transposed matrix. Your program shall include the following: a) Define two 2 dimensional arrays, M and N that each represents a matrix of size 3 x 2 and a matrix of size 2 x 2. Request the user to enter the values for the 2 arrays using advanced pointer notations (refer to your slides for the list of array pointer notations). b) Create a function named multMatrix() that passes as arguments, the values of array M and N, multiplies them and store the results in a new…
PLEASE USE PYTHONGiven a jungle matrix NxM:jungle = [ [1, 0, 0, 0], [1, 1, 0, 1], [0, 1, 0, 0], [1, 1, 1, 1,]]Where 0 means the block is dead end and 1 means the block can be used in the path fromsource to destination.Task:Starting at position (0, 0), the goal is to reach position (N-1, M-1).Your program needs to build and output the solution matrix – a 4x4 matrix with 1’s inpositions used to get from the starting position (0,0) to the ending position (N-1,M-1)with the following constraints:You can only move one space at a timeYou can only in two directions: forward and down.You can only pass thru spaces on the jungle matrix marked ‘1’If you cannot reach the ending position – print a message that you’re trapped in thejungleAlgorithm:If destination is reachedprint the solution matrixElseMark current cell in the solution matrixMove forward horizontally and recursively check if this leads to a solution If there is no solution, move down and recursively check if this leads to a solution If…
Write and test a Python function, that makes use of numpy, to return the sum of the elements onthemain diagonal (upper left to lower right) of a square matrix. In linear algebra, this value is calledthetrace of the matrix.For example, with a matrix represented as a list of lists eg. [[9, 8, 7], [6, 5, 4], [3, 2, 1]], yourfunctionshould return (9 + 5 + 1) = “15”Your Python function solution should work for any sized square matrix passed to it. Demonstratethat this is the case with 3x3, 4x4, and 6x6 matrix examples.
Write a code in "C++"that can swap all the values of its first row with its last row in a [n×m] matrix After swapping, add all the values of the last column.(using C++ only)
Pls Use Python Using NumPy, write the program that determines whether the A=({{1, 5, -2}, {1, 2, -1}, {3, 6, -3}}) matrix is nilpotent. Itro: Nilpotent Matrix: A square matrix A is called nilpotent matrix of order k provided it satisfies the relation, Ak = O and Ak-1≠O where k is a positive integer & O is a null matrix of order k and k is the order of the nilpotent matrix A . The following picture is an example of the intro: Ps: Please also explain step by step with " # "
Computer Science Given an N x N matrix M with binary entries i.e every entry is either 1 or 0. You are told that every row and every column is sorted in increasing order. You are required to output a pair (i,j) with 1 <= i and j <= n corresponding to the entry of the matrix satisfying Mij = 1 and Mrs = 0 for all 1 <= r <= i and 1 <= s <= j except for Mij Informally this includes the entry of M = 1 and is closest to the top left corner. for example: M = [ 0 0 0 1 0 0 1 1 0 0 1 1 0 0 1 1] output is (2,3) or (1,4) M = [ 0 1 1 1 1 1 1 1 1] output could be (1,2) or (2,1) Design a divide and conquer algorithm, explain correctness and runtime of the algorithm.
Write a code in "C"that can swap all the values of its first row with its last row in a [n×m] matrix After swapping, add all the values of the last column.
The code of a sequential search function is shown on textbook page 60. In fact, if the list is already sorted, the search can halt when the target is less than a given element in the list. For example, given my_list = [2, 5, 7, 9, 14, 27], if the search target is 6, the search can halt when it reaches 7 because it is impossible for 6 to exist after 7. Define a function linearSearchSorted, which is used to search a sorted list. This function displays the position of the target item if found, or ‘Target not found’ otherwise. It also displays the elements it has visited. To test your function, search for these targets in the list [2, 5, 7, 9, 14, 27]: 2, 6, 14, 27 and 28.
Can you ask with the python software language? A 2D matrix can be represented as a list and a column count value in Python. For example, the 3x3 matrix 1 2 3 4 5 6 7 8 9 can be row-wise represented as ([1,2,3,4,5,6,7,8,9], 3), where the number 3 represents the number of columns in the matrix. Similarly, 1 3 5 2 4 6 becomes ([1,3,5,2,4,6], 3). A submatrix can be defined as an (l,r,t,b) tuple, where l and r are left and right column indices, and t and b are top and bottom row indices (all inclusive). Write a function that takes a tuple containing the list representing a matrix, and the column count of the matrix, along with another tuple representing a specific submatrix, and returns the list representation of the submatrix along with its column count as a tuple. For example, given submatrix(([1,2,3,4,5,6,7,8,9,10,11,12], 4), (1,2,0,1)) returns: ([2,3,6,7], 2) def submatrix(matrix, indices):
Write a function called "Replace ALL" that accepts two parameters: a matrix of 20x10 elements of type integer and an integer value x . The function must: - Replace every positive matrix element by the value +1, and - Replace every negative matrix element by the value -1, and • Replace every zero by the value x.