3. Given a map, there are minefields and safe areas on the map. Find the largest minefield on the map and return its area. If there are no mines on the map, 0 is returned. Pseudocode of your algorithms. Implement algorithms for the problem. Analyze the complexity of your algorithms. Minefield 1 [0,1,1,0,0] [1,1,0,1,1] {} minefield , safe area [0,0,1,0,0] [0,0,1,1,0] Safe area Minefield 3 ] Output: 4 Explanation: There are three minefields on the map. Their areas are 4, 2, and 3. The maximum area is 4, so return 4. Input: map =[ Minefield 2

3. Given a map, there are minefields and safe areas on the map. Find the largest minefield on the map and return its area. If there are no mines on the map, 0 is returned. Pseudocode of your algorithms. Implement algorithms for the problem. Analyze the complexity of your algorithms. Minefield 1 [0,1,1,0,0] [1,1,0,1,1] {} minefield , safe area [0,0,1,0,0] [0,0,1,1,0] Safe area Minefield 3 ] Output: 4 Explanation: There are three minefields on the map. Their areas are 4, 2, and 3. The maximum area is 4, so return 4. Input: map =[ Minefield 2

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

Let U = {1,2,3,4,5,6,7,8,9,10}....
Sorting objects in the real world https://docs.oracle.com/javase/8/docs/api/java/util/LinkedList.html There are 5000 people living in the town. Every day they have new COVID-19 cases. When people show symptom, they go to the hospital and put themselves in the waiting list for testing. A new person is added at the end of the list. Due to the lack of testing kit, all in the list cannot be tested. Hospital has to sort them and select a few. Since the elderly is very weak to the COVID-19, every midnight the doctors sort the people in the list by their age to decide who is taking the test for the next day depending on the availability of testing kit. Input to the program has the form where the first line indicates how many days they will do the operation. For each day, the input starts with the day number, along with the following patient list where each element represents the name of patients and the age. The input ends with the number of available testing kits. The output display, at…
Please help me Josephus Problem is a theoretical problem related to a certain counting-out game. On thiscase, people are standing in a circle waiting to be executed. After a specified number ofpeople are skipped, the next person is executed. The procedure is repeated with theremaining people, starting with the next person, going in the same direction and skippingthe same number of people, until one person remains, and is freed.Arrange the numbers 1 , 2, 3 , ... consecutively (say, clockwise) in a circle. Now removenumber 2 and proceed clockwise by removing every other number, among those thatremain, until one number is left. (a) Let denote the final number which remains. Find formula for .(b) If there are 70 people, what is the safe number (the number that remains)?
Solve using JAVA only Given a square chess board of size N, solve the N queens problem. ONLY Print out the NUMBER of solutions for a given N. DO NOT print out or produce the actual solutions, the code shold ONLY PROVIDE the number of correct solutions. Solve for N between 2 and 8. Try your program with 9 and 10, produce those results if it returns in a reasonable amount of time. The N queens problem is to find every configuration of N queens distributed on an NxN square chess board such that all queens are safe from attack by each other.
A parking lot in a mall has RxC number of parking spaces. Each parking space will either be empty (0) or full(1). The status (0/1) of a parking space is represented as the element of the matrix. The task is to find index of the prpeinzta row (R) in the parking lot that has the most of the parking spaces full(1). Solve in Java Language Please.
private boolean createExhaustiveBoard(int index) { for (int j = 0; j < n; j++) { for (int k = index; k < n; k++) //sets board to -1 again { board2[k] = -1; } board2[index] = j; //checks each queen for attackers if (checkForHorzKillNew(board2, index) != 0 || checkForDiagKillNew(board2, index) != 0) { continue; } if (index == n - 1) //tells algorithm to stop as array would go out of bounds { return true; } else { boolean solutionFound = createExhaustiveBoard(index + 1); //recursively runs for next index to place all queens board2Swaps++; if (solutionFound) { return true; } } } return false; } N Queens problem Analyse the time effiency of the above recursion and give a formula for best and worst case
Implement an algorithm that returns the X closest items to a value V, for any array of integer elements. V may or may not be present in the array. Its solution must be O(nlogn). (phyton or Java). Note: The proposed solution must use the divide-and-conquer strategy.
Assuming an implementation of a class of undirected graphs, implement a method that detects whether an undirected graph is acyclic. You can look for cycles during either a breadth-first traversal or a depth-first traversal by discovering an edge to a vertex that is not the predecessor and has already been visited. To simplify the problem initially, you can assume that the graph is connected. Then remove this assumption.' Java program
Solve using JAVA only Given a square chess board of size N, solve the N queens problem. Print out the number of solutions for a given N. You do not need to print out or produce the actual solutions, only the number of correct solutions. Solve for N between 2 and 8. Try your program with 9 and 10, produce those results if it returns in a reasonable amount of time. The N queens problem is to find every configuration of N queens distributed on an NxN square chess board such that all queens are safe from attack by each other.
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…
Implement Velocity Verlet • Bouncing test: Simulate two particles starting from some distance approaching each other with some speed. Plot x(t), v(t), V(t), K(t) and H(t). Are they bouncing? Is H conserved? • Find the longest ∆t that conserves H to high precision in the bouncing test . I want simulation in python
Consider a group of balls where each ball is one of k colors. You can assume that there is an equal number of balls of each color. Each ball, aside from its color, has a written integer on it. The numbers are in no way associated with the color. a) Devise an algorithm that orders all the balls according to colors in a way that no ball comes before a ball of a lighter color. In other words, how do you order balls from lightest to darkest, however, inside one group (i. e., one color), balls can be ordered in any way with respect to the number written on the ball. Design an algorithm and analyze it. b) Now take the output from (a), and also order balls within the color. How much time is needed for this step?