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

Similar questions

Here__Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water. Example 1: Input: grid = [ ["1","1","1","1","0"], ["1","1","0","1","0"], ["1","1","0","0","0"], ["0","0","0","0","0"] ] Output: 1 Example 2: Input: grid = [ ["1","1","0","0","0"], ["1","1","0","0","0"], ["0","0","1","0","0"], ["0","0","0","1","1"] ] Output: 3.
Write a program that reads movie data from a csv (comma separated values) file and output the data in a formatted table. The program first reads the name of the CSV file from the user. The program then reads the csv file and outputs the contents according to the following requirements: Each row contains the title, rating, and all showtimes of a unique movie. A space is placed before and after each vertical separator (|) in each row. Column 1 displays the movie titles and is left justified with a minimum of 44 characters. If the movie title has more than 44 characters, output the first 44 characters only. Column 2 displays the movie ratings and is right justified with a minimum of 5 characters. Column 3 displays all the showtimes of the same movie, separated by a space. Each row of the csv file contains the showtime, title, and rating of a movie. Assume data of the same movie are grouped in consecutive rows. Ex: If the input of the program is: movies.csv and the contents of movies.csv…
Given an xn grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once. Example 1: A В С F C A DE Input: board = [["A","8","C", "E"1.1"S","F", "C","S"1.1"A", "D", "E", "E"11, word = "ABCCED" Output: true
Write a program that reads movie data from a csv (comma separated values) file and output the data in a formatted table. The program first reads the name of the CSV file from the user. The program then reads the csv file and outputs the contents according to the following requirements: Each row contains the title, rating, and all showtimes of a unique movie. A space is placed before and after each vertical separator (|) in each row. Column 1 displays the movie titles and is left justified with a minimum of 44 characters. If the movie title has more than 44 characters, output the first 44 characters only. Column 2 displays the movie ratings and is right justified with a minimum of 5 characters. Column 3 displays all the showtimes of the same movie, separated by a space. Each row of the csv file contains the showtime, title, and rating of a movie. Assume data of the same movie are grouped in consecutive rows. Ex: If the input of the program is: movies.csv and the contents of movies.csv…
Write a program that prints an mxn matrix whose dimensions are specified by the user. Let the matrix values be random variables. You must use it within the repetition cycle. Example format: Enter dimension of matrix mxn: 2 4 The 2x4 matrix is : 1 2 3 4 5 6 7 8
Write a program that reads movie data from a CSV (comma separated values) file and output the data in a formatted table. The program first reads the name of the CSV file from the user. The program then reads the CSV file and outputs the contents according to the following requirements: Each row contains the title, rating, and all showtimes of a unique movie. A space is placed before and after each vertical separator ('|') in each row. Column 1 displays the movie titles and is left justified with a minimum of 44 characters. If the movie title has more than 44 characters, output the first 44 characters only. Column 2 displays the movie ratings and is right justified with a minimum of 5 characters. Column 3 displays all the showtimes of the same movie, separated by a space. Each row of the CSV file contains the showtime, title, and rating of a movie. Assume data of the same movie are grouped in consecutive rows. Hints: Use the find() function to find the index of a comma in each row of…
Children often play a memory game in which a deck of cards containing matching pairs is used.The cards are shuffled and placed face down on a table. The players then take turns and selecttwo cards at a time. If both cards match, they are left face up; otherwise, the cards are placed facedown at the same positions. Once the players see the selected pair of cards and if the cards do notmatch, then they can memorize the cards and use their memory to select the next pair of cards.The game continues until all the cards are face up. Write a program to play the memory game.Use a two-dimensional array of 4 rows and 4 columns for a deck of 16 cards with 8 matchingpairs. You can use numbers 1 to 8 to mark the cards. Use random number generators to randomlystore the pairs in the array. Use appropriate functions (see below) in your program, and themain program should be merely a call to functions.Your program should consist of at least the following functions:a. A function to fill the board…
Write a program (script file) that prompts the user to input an arbitrary vector X, for example [59 -12 -10...-12 8], and uses for-loop to set all positive values in X to zero. Note: the total number of elements in X is arbitrary. Upload Choose a File
In python, create a word ladder using breadth fist search. The program should open a file that contains more than 10000 that are the legal words to build the ladder. You will have a first word and an end word that would be in a file that the program should read. Simply, from a given starting word, find the shortest "ladder" of single letter changes which leads to some final word, where each intermediate state is also a word. For example: clash, flash, flask, flack, flock, clock, crock, crook, croon, crown, clown. As you might infer from the example above, there is no simple algorithm that generates a word ladder. Rather, you have to search for a ladder by generating all of the possibilities. Doing so will give you an opportunity to use Python data structures like lists, sets and dictionaries. Your program should first read in a file with 10000 words giving it a large collection of words to work with. All of the examples in the tests that your program will be given will be of…
Write a program (script file) that prompts the user to input an arbitrary vector X, for example [5 9 -12 -10 ... -12 8], and uses while-loop to set all positive values in X to zero. Note: the total number of elements in X is arbitrary.
INPUT: Your program will read an undirected graph representation from a file called graph.txt (text file). The first line contains a number, which is the number of vertices (n). We assume the vertices are 1,2,3,…, n The second line will show 2 distinct numbers between 1 and n. After these 2 lines, there will be the edges listed in separate lines with three numbers: The first two numbers represent the edge ends (undirected graph), while the third number is the weight for that edge. For example, the graph in Figure 8.4.7 is represented as follows: 6 16 122 141 233 251 451 362 562 The program will implement the Dijkstra’s Algorithm and OUTPUT [the shortest path] and [the total weight] between the 2 vertices in line 2, e.g., for the graph above it should output: [1,4,5,6] [4]
Write a program that reads a list of words. Then, the program outputs those words and their frequencies. The input begins with an integer indicating the number of words that follow. Assume that the list will always contain fewer than 20 words. Ex: If the input is: 5 hey hi Mark hi mark the output is: hey 1 hi - 2 Mark - 1 hi - 2 mark - 1 Hint: Use two vectors, one vector for the strings and one vector for the frequencies. LAB ACTIVITY 5.18.1: LAB - Word frequencies 1 #include #include 4 using namespace std; SOUN int main() { /* Type your code here. / return 0; Develop mode Submit mode main.cpp Load default template... Run your program as often as you'd like, before submitting for grading. Below, type any needed input values in the first box, then click Run program and observe the program's output in the