Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.For example, for the following board,X X X XX O O XXXOXхоххAfter capturing all regions, the board becomesX X X XX X XXX X X XхоххThe algorithm should take an input file, named input.txt, and output the resulting board inthe console.Sample input.txt:XXXX хохохо охX X 0 0 O XX X X O X Xхоххо оX X X X X XThe first line is a number indicating the size of the board; in the above example, 6 means theboard is 6 x 6.Output for in console:X X X X XOХXXXX хX X X X XXXXXX ххXXXX ООXX X X X XTo clarify 'being surrounded', consider the following example:1 x 3хох7 x 9The center O IS surrounded by Xs regardless of the symbols at positions 1, 3, 7, and 9. That beingsaid, we only need to check the neighbors above, below, to the left, and to the right, in order todetermine whether a region is surrounded or not. Elements on the diagonal should not be takeninto account.

code : #include<iostream> #include <fstream> using namespace std; #define MAX 20…

Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in that surrounded region. For example, for the following board, xxxX

Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in that surrounded region. For example, for the following board, xxxX

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

Related questions

Q: Party hearing. As the number of people at a party increases, you must raise your voice for a…

A: For ri = 1.40 m and Δβ = 4.60 dB rf will be solved using the below solution

Q: Write a function find_equivalent_matchings that takes a matching and returns all matchings with the…

A: {(2, 3), (0, 5), (4, 7), (1, 6)}{(2, 3), (0, 7), (4, 6), (1, 5)}{(3, 4), (0, 7), (6, 1), (2, 5)}{(4,…

Q: Build a polyhedron that looks roughly the washington monument . Some key dimensions of the…

A: The code uses Three.js to create a Washington Monument-like 3D model. Three.js is a sophisticated…

Q: Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is…

A: Initialize Counter: Initialize the count of islands to 0.Iterate Over Grid: For each cell in the 2D…

Q: Build a polyhedron that looks roughly like the Washington monument. Some key dimensions of the…

A: To build a polyhedron that looks roughly like the Washington Monument using the given code, we can…

Q: Build a polyhedron that looks roughly like the Washington monument. Some key dimensions of the…

A: The code uses Three.js to create a Washington Monument-like 3D model. Three.js is a sophisticated…

Q: Q1. Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is…

A: 1) Below is program to count number of islands, given a 2d grid map of '1's (land) and '0's (water),…

Q: Here are the arrow diagrams of two maps: D. Is the map on the right the inverse of the map on the…

Q: The figures illustrate a solution for a game played on a 4x4 board with three blue marbles, three…

A: In order to solve the Marble Game and determine the fewest number of moves, we can implement a…

Q: We expect the closed form solution have a polynomial function by n. The first step to find the…

A: We need to solve multiple equations to find the values of variables

Q: agents: An agent is trying to eat all the food in a maze that contains obstacles, but he now has the…

A: Note: Answering the first three subparts as per the guidelines. Given : Search task is given Agent…

Concept explainers

Polynomial Time

The problems for which the deterministic polynomial-time algorithm exists belong to the complexity class (p) and it is central in the field of computational complexity theory. According to Cobham’s thesis, polynomial time is a synonym for “feasible”, “fast”, and “efficient”.

Question

Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.
A region is captured by flipping all 'O's into 'X's in that surrounded region.
For example, for the following board,
X X X X
X O O X
XXOX
хохх
After capturing all regions, the board becomes
X X X X
X X XX
X X X X
хохх
The algorithm should take an input file, named input.txt, and output the resulting board in
the console.
Sample input.txt:
XXXX хо
хохо ох
X X 0 0 O X
X X X O X X
хоххо о
X X X X X X
The first line is a number indicating the size of the board; in the above example, 6 means the
board is 6 x 6.
Output for in console:
X X X X XO
ХXXXX х
X X X X XX
XXXX хх
XXXX ОО
XX X X X X
To clarify 'being surrounded', consider the following example:
1 x 3
хох
7 x 9
The center O IS surrounded by Xs regardless of the symbols at positions 1, 3, 7, and 9. That being
said, we only need to check the neighbors above, below, to the left, and to the right, in order to
determine whether a region is surrounded or not. Elements on the diagonal should not be taken
into account.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Build a polyhedron that looks roughly like the Washington monument. Some key dimensions of the Washington Monument: o The width of the base is about 55 feet.o The width of each side at the top is about 34 feet.o The height of the small pyramid (pyramidion) at the top of the monument is 55 feet. o The height of the whole monument is 555 feet. This should help you get something that looks approximately like the Washington monument. Exactness is not necessary, and indeed, you should make your code appropriately parameterized.Some additional requirements. Your polyhedron will have 8 sides (four for the pyramidion and four for the tower). You should not have a base. The origin of the monument should be at the center of the base, directly below the peak. Each side should be a different color, so that all the edges are plainly visible. o Use a variety of different ways of specifying the colors (e.g. THREE.ColorKeywords, hexidecimal notation, CSS string, RGB) o Use RGB color at least…
using python Develop a simulation and visualization of a pit viper hunting for food in a cool environment. Have one rodent moving and resting at random. Most mammals have an average body temperature of around 37 ºC. For example, the normal body temperature of a rabbit is 38.3 ºC, and that of a laboratory ’“use is 36.9 ºC. Have one pit viper that tends to move toward warmth. In the case of the same temperature in all neighboring cells, the snake selects a direction at random.
agents: An agent is trying to eat all the food in a maze that contains obstacles, but he now has the help of his friends! An agent cannot occupy a square that has an obstacle. There are initially k pieces of food (represented by dots), at positions (f1,...,fk). There are also n agents at positions (p1,...,pn). Initially, all agents start at random locations in the maze. Consider a search problem in which all agents move simultaneously ;that is, in each step each agent moves into some adjacent position (N, S, E, or W, or STOP). Note that any number of agents may occupy the same position. Figure 1: A maze with 3 agents For each of the following heuristics, indicate (yes/no) whether or not it is h1: The number of dots (representing food) remaining. [ True, False ]. h2(s)=0, where s is a state node. [ True, False ]. h3(s)=1, where s is a state node. [ True, False ].
Please read the thickened sentences below In this game, one flyand three frogs are placed randomly on a board with the size 7x7.In each iteration, they move randomlywithin the board, and the simulation stops when one of the frogs eats the fly.Fly and frogs are essentially creatures that can move, make noise, and eat. Frogs can move up to 2squares in any direction, and flies can move up to 1. Frogs make the "Croak! Croak!" sound, and fliesmake "ZzzZZz!". Since frogs should not eat their kind, a function of "isEatable" should also beimplemented in decision making. A variable or function to check if the fly is alive is also required as aterminate condition for simulation.In each iteration, an 'f' character represents frogs' position on board, and an '*' character is used torepresent the position of fly. Java language please I dont want the survival game starting with the code below I want in Java language and like in photos please #functions def GenerateRandomScene(): scenes =…
Mubashir is eating a watermelon. • He spits out all watermelon seeds if seeds are more than five. • He can swallow all watermelon seeds if seeds are less than or equal to five. • He can eat 1/4 of a watermelon each time. Given a 2D array of watermelon where is representing juicy watermelon while 1 is representing seed, return total number of seeds spit-out. See below example for detailed explanation : Given a watermelon: 1, 0, 0, 1, 1, 1, 0, 1 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1 1, 0, 1, 1, 0, 0, 0, 0 0, 0, 0, 0, 0, 0, 0, 0 1, 1, 1, 1, 0 seeds = 0 total seeds = 0
Write a code that can be used to plot a 3D graph where x & y are between -5 to 5 and z is defined by the following equation. “z=4x4y - 3x3y2 + x”
You are given a 2 by n grid, where the cell on row i column j contains a non-negative number ai,j . You can start at either cell in the lefttmost column, and your goal is to reach either cell in the rightmost column by a sequence of moves. You can move to an adjacent cell (if it exists) in each of the 4 cardinal directions (up,down, left and right). A path achieves a score equal to the sum of values in its cells. Note that a cell which is used twice in a path only counts its value once to the score of that path.Design an algorithm which runs in O(n) time and finds a path of minimum score from the leftmost column to the rightmost column.
Write a program that plays the tic-tac-toe game. Two players take turns clicking an available cell in a grid with their respective tokens (either X or O). When one player has placed three tokens in a horizontal, vertical,or diagonal row on the grid, the game is over and that player has won. A draw (no winner) occurs when all the cells in the grid have been filled with tokens and neither player has achieved a win. Figure 12.17 shows the representative sample runs of the example. Assume that all the cells are initially empty, and that the first player takes the X token and the second player the O token. To mark a cell, the player points the mouse to the cell and clicks it. If the cell is empty, the token (X or O) is displayed. If the cell is already filled, the player’s action is ignored.Define a custom class named Cell that extends Label for displaying a token and for responding to the button-click event. The class contains a data field token with three possible values—' ', X, and…
Build a polyhedron that looks roughly like the Washington monument. Some key dimensions of the Washington Monument: o The width of the base is about 55 feet.o The width of each side at the top is about 34 feet.o The height of the small pyramid (pyramidion) at the top of the monument is 55 feet. o The height of the whole monument is 555 feet. This should help you get something that looks approximately like the Washington monument. Exactness is not necessary, and indeed, you should make your code appropriately parameterized.Some additional requirements. Your polyhedron will have 8 sides (four for the pyramidion and four for the tower). You should not have a base. The origin of the monument should be at the center of the base, directly below the peak. Each side should be a different color, so that all the edges are plainly visible. o Use a variety of different ways of specifying the colors (e.g. THREE.ColorKeywords, hexidecimal notation, CSS string, RGB) o Use RGB color at least…
Mastermind is a code-breaking game for two players. In the original real-world game, one player A selects 4 pegs out of 6 colors and puts them in a certain fixed order; multiples of colors are possible (for example, red-green red-green). His opponent B does not know the colors or order but has to find out the secret code. To do so, B makes a series of guesses, each evaluated by the first player. A guess consists of an ordered set of colors which B believes is the code. The first player A evaluates the guess and feeds back to B how many positions and colors are correct. A position is correct ("black") if the guess and the secret code have the same color. Additional colors are correct ("white"), if they are in the guess and the code, but not at the same location. For example1 2 3 4secret: red-green red greenguess: red blue green purpleresults in one correct position ("black = 1") for the red peg at position one and one additional correct color ("white=1") for the green peg in the guess.…