Given a jungle matrix NxM: jungle = [ [1, 0, 0, 0], [1, 1, 0, 1], [0, 1, 0, 0], [1, 1, 1, 1,1 1 Where O means the block is dead end and 1 means the block can be used in the path from source to destination. Source 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 in positions 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 time You 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 the jungle Algorithm: If destination is reached Dest. Else print the solution matrix Mark current cell in the solution matrix Move 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 solutio If none of the above solution work, unmark the cell and return false

Given a jungle matrix NxM: jungle = [ [1, 0, 0, 0], [1, 1, 0, 1], [0, 1, 0, 0], [1, 1, 1, 1,1 1 Where O means the block is dead end and 1 means the block can be used in the path from source to destination. Source 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 in positions 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 time You 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 the jungle Algorithm: If destination is reached Dest. Else print the solution matrix Mark current cell in the solution matrix Move 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 solutio If none of the above solution work, unmark the cell and return false

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

Hi I need help writing a java program that implements Prim's algorithm. The imput of the program is given by the scanner with an undirected graph. First input line is the number of vertices, second input is the number of undirected edges. After that the input is a matrix of 3 by the number of undirected edges. The matrix firt 2 column contain the end points and the third column contains the weight . The output of the program is an integer representing the sum of all the edges that make up the minimum spanning tre. I have attach a picture for farther details. THANKS
In pythion with numpy I have code in a for loop that creates a vecor of 12 elements:x = 1 2 3 4 5 6 7 8 9 10 11 12 The loop iterates 10 times. The second iteration generates a new vector x = 12 11 10 9 8 7 6 5 4 3 2 1 etc. At the end of the loop I need to have a 12 X 10 matrix x x x x x x x x x x x x x x x x x x x xx x x x x x x x x x x x x x x x x x x xx x x x x x x x x x x x x x x x x x x xx x x x x x x x x x x x x x x x x x x xx x x x x x x x x x x x x x x x x x x xx x x x x x x x x x x x x x x x x x x x I cannot figure out how to createa matrix where it takes the output and uses the output as row
Write code for complete application that includes all the code for computing the shortest paths using Dijkstra’s algorithm, along with a program to test the implementation:
javascript only: You have been assigned to work with an undersea explorer who is attempting to identify and map undersea trenches. The explorer has provided you with several data sets. Depending on the scan, the provided matrix may be larger or smaller, but it will always be rectangular. Your task is to determine if a given data set contains a trench by comparing each node and their neighbors and determining if there is a pattern that matches the defined properties of a trench. Neighbors are considered to be nodes that are directly above, below, or to the side. No diagonals! A trench has the following three properties: It has a length of three or more nodes that are neighbors. Each node in the trench must be deeper than -5. Trenches may not branch into (any form of) a "T" shape. A node with more than two neighbors will result in branching "T" shape. // Example 1 sonar = [ [-5,-5,-5,-5,-5], [-5,-8,-8,-9,-7], [-5,-5,-5,-5,-8], [-5,-5,-5,-5,-5] ]
Please debug the following trenchTranveral javascript function. The function should return true if the node's value is less than -5 and false if equal to or greater than -5. function findNeighbors(node, matrix) { const neighbors = []; const [row, col] = node; const currNum = matrix[row][col]; // Check top if (matrix[row - 1] && Math.abs(matrix[row - 1][col] < - 5)) { neighbors.push([row - 1, col]); } // Check bottom if (matrix[row + 1] && Math.abs(matrix[row + 1][col] < - 5)) { neighbors.push([row + 1, col]); } // Check left if (matrix[row][col - 1] && Math.abs(matrix[row][col - 1] < - 5)) { neighbors.push([row, col - 1]); } // Check right if (matrix[row][col + 1] && Math.abs(matrix[row][col + 1] < - 5)) { neighbors.push([row, col + 1]); } // Return neighbors return neighbors; // Only consider N, S, E, W nodes } function trenchTraversal(node, matrix, visited) { const [row, col] = node; let stack = [node] visited.add(node.toString())…
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.
Consider a maze represented by a matrix of m rows and n columns with obstacles (see the figure below). A cell with a value = -1 is an obstacle that cannot be overcome. The goal is to start from cell [0, 0] and reach the last cell [m-1, n-1]. This may be possible by taking several paths. Count the number of these paths. The movement is allowed from cells (i+ 1, j) and (i, j+ 1) only. -1 -1 Provide two solutions, one iterative and one recursive to the above problem.
Nim is a two-player game The rules are as follows. The game starts with a single stack of 7 tokens. At each move a player selects one stack and divides it into two non-empty, non-equal stacks. A player who is unable to move loses the game. Draw the complete search tree for nim. The answer is as given:
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. each individual has a rating chart portrayed by a variety of integers an of length n. You are currently refreshing the foundation, so you've made a program to pack these diagrams. The program functions as follows. Given an integer boundary k, the program takes the base of each adjoining subarray of length k in a. All the more officially, for a cluster an of length n and an integer k, characterize the k-pressure exhibit of an as a cluster b of length n−k+1, to such an extent that bj=minj≤i≤j+k−1ai For instance, the 3-pressure cluster of [1,3,4,5,2] is [min{1,3,4},min{3,4,5},min{4,5,2}]=[1,3,2]. A stage of length m is an exhibit comprising of m unmistakable integers from 1 to m in subjective request. For instance, [2,3,1,5,4] is a stage, however [1,2,2] isn't a change (2 shows up twice in the exhibit) and [1,3,4] is likewise not a stage (m=3 but rather there is 4 in the…
the number of edges in a complete 2 of 2 undirected graph of 80 vertices is.? Select one: a. exactly equals 3160 b. None c. less than or equals 3160 d. less than or equals 6320 e. exactly equals 6320 Assume that you have a doubly link list. Pointer x is pointing to the last node in the link list and pointer y is pointing to before the last node. which of the following will remove the node pointed by x from the list? Select one: O a. delete x; b. y->prev->next = y->next; X->prev= y->prev; delete x; O C. X->prev->next = x->next; y->prev= x->prev; delete x; O d. x->next = y; y->prev = x->prev; delete x;
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…
Wireless sensor networks (WSNs) refer to a domain of communication networks. In a WSN, small devices called sensor nodes are used for data transfer among each other and a base station. One limitation of a sensor node is that it has a very limited processing capability and very small memory. Consider a scenario in which you have an algorithm that can be subdivided into smaller problems. If you have to run these sub-problems in different sensor nodes, would you prefer to use divide & conquer approach or dynamic programming approach? Write briefly and precisely.