Make an application that receives in code by means of a two-dimensional array (of variable length) a Minesweeper scenario, where there is a 0 where there are no mines and a -1 where there are. For each box that does not have a mine, state how many adjacent mines there are (diagonally, horizontally and vertically). Internally, the program will carry out the actions with a function defined as "def countingMines (myField) " that will return a two-dimensional array with the number of mines adjacent in each position. Example Input (read by keyboard) 00-10 0-1 -1 0 Example Output (displayed on screen) 13-1 2 1-1 -1 2

Make an application that receives in code by means of a two-dimensional array (of variable length) a Minesweeper scenario, where there is a 0 where there are no mines and a -1 where there are. For each box that does not have a mine, state how many adjacent mines there are (diagonally, horizontally and vertically). Internally, the program will carry out the actions with a function defined as "def countingMines (myField) " that will return a two-dimensional array with the number of mines adjacent in each position. Example Input (read by keyboard) 00-10 0-1 -1 0 Example Output (displayed on screen) 13-1 2 1-1 -1 2

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter8: Advanced Method Concepts

Section: Chapter Questions

Problem 8RQ

See similar textbooks

Similar questions

You have been hired at an open-air mine. You are to write a program to control a digger. For your task, you have been given a 'map' of all the underground resources in the mine. This map comes as atwo-dimensional integer array. The array has n rows and k columns. Each integer is between zero and one hundred (inclusive). This array represents a grid map of the mine – with each row representing a different height level. Each square in the grid can contain valuable resources. The value of these resources can go from zero (no resources) to 100 (max resources). The grid maps the resources just below the surface, and down to the lowest diggable depths. The digger starts at the surface (so, just on top of the topmost row in the grid)—at any horizontal position between 1 and k. The digger cannot dig directly downwards, but it can dig diagonally in either direction, left-down, or right-down. In its first time-step, it will dig onto the first row of the grid. In its second time-step, it'll hit…
Functions with 2D Arrays in Java Write a function named displayElements that takes a two-dimensional array, the size of its rows and columns, then prints every element of a two-dimensional array. Separate every row by a new line and every column by a space. In the main function, call the displayElements function and pass in the required parameters. Output 1 2 3 4 5 6 7 8 9
Implement this program to understand use of Arrays in real world examples. A small airline has just purchased a computer for its new automated reservations system. You have been asked to develop the new system. You are to write an application to assign seats on each flight of the airline’s only plane (capacity: 10 seats). Your application should display the following alternatives: Please type 1 for First Class and Please type 2 for Economy. If the user types 1, your application should assign a seat in the first-class section (seats 1–5). If the user types 2, your application should assign a seat in the economy section (seats 6–10). Your application should then display a boarding pass indicating the person’s seat number and whether it is in the first-class or economy section of the plane. Use a one-dimensional array of primitive type boolean to represent the seating chart of the plane. Initialize all the elements of the array to false to indicate that all the…
Write a C++ code that contains a heuristic function to be used in the PACMAN game with one ghost only.The environment is 5x5 cells: each cell can contain the following value:0: empty cell1: cell contains a pill2: cell contains a pacman3: cell contains a ghost only4: cell contains a ghost and a pill5: cell contains a ghost and pacman.the program must contain one state as 2d array with fixed values and return the heuristic value for that cell.
Write a C++ code that contains a heuristic function to be used in the PACMAN game with one ghost only.The environment is 5x5 cells: each cell can contain the following value:0: empty cell1: cell contains a pill2: cell contains a pacman3: cell contains a ghost only4: cell contains a ghost and a pill5: cell contains a ghost and pacman.the program must contain one state as 2d array with fixed values and return the heuristic value for that cell. the user determine the position of the packman and ghost and the program return the heuristic value
Instructions: In the code editor, you are provided with the definition of a struct Person. This struct needs an integer value for its age and character value for its gender. Furthermore, you are provided with a displayPerson() function which accepts a struct Person as its parameter. In the main() function, there's a pre-created array of 5 Persons. Your task is to ask the user for the values of the age and gender of these Persons. Then, once you've set their ages and genders, call the displayPerson() function and pass them one by one. Input 1. A series of ages and genders of the 5 Persons Source Code: #include<stdio.h> typedef struct { int age; char gender;} Person; void displayPerson(Person); int main(void) { Person persons[5]; return 0;} void displayPerson(Person p) { printf("PERSON DETAILS:\n"); printf("Age: %d\n", p.age); printf("Gender: "); if(p.gender == 'M') { printf("Male"); } else { printf("Female"); }…
an int variable k, an int array currentMembers that has been declared and initialized, an int variable nMembers that contains the number of elements in the array, an int variable memberID that has been initialized, and a bool variable isAMember, Write code that assigns true to isAMember if the value of memberID can be found in currentMembers, and that assigns false to isAMemberotherwise. Use only k, currentMembers, nMembers, and isAMember.
Java Program - Functions with 2D Arrays Write a function named displayElements that takes a two-dimensional array, the size of its rows and columns, then prints every element of a two-dimensional array. Separate every row by a new line and every column by a space. In the main function, write a program that asks for integer input to be assigned on a 3 x 3 array and call the function displayElements to print the contents on the next line. Input 1. Multiple lines containing integer each line Output R1C1: 1 R1C2: 2 R1C3: 3 R2C1: 4 R2C2: 5 R2C3: 6 R3C1: 7 R3C2: 8 R3C3: 9 1 2 3 4 5 6 7 8 9
Create 10 accounts in an array with id 0, 1, ..., 9, and an initial balance of $100. The system prompts the user to enter an id. If the id is entered incorrectly, ask the user to enter a correct id. Once an id is accepted, the main menu is displayed as shown in the sample run. You can enter choice 1 for viewing the current balance, 2 for withdrawing money, 3 for depositing money, and 4 for exiting the main menu. Once you exit, the system will prompt for an id again. Thus, once the system starts, it will not stop.
Write a function called FindMyChar that receives three parameters: . the name of the array • the array size • a character ch The function must return the index number in which the character ch is in your array. If the character ch is not found of the array, insert ch in the last index of the array and return that index number. This index number will be printed from your main( ). For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). BIUS Paragraph Arial 14px A v ... Click Save and Submit to save and submit. Click Save All Answers to save all answers. Save All Answers Save and Submit 梦 $ 耳 a 911A S/19/20 hp 12 -> ort sc home delete nd %24 4. & 7. 6 8 num %3D backspace lock R Y. home 4. enter pause 1 shift end alt ctrl
A university is analysing students' academic performance in a course using an application. As shown below, the application generates a list of final marks and an academic performance reрort: The following information is required to generate the final mark listing and academic performance report: Course details The course details to be stored in the program include a list (array) of final marks, number of students, a list (array) of the distribution of frequencies of grades. The final marks are stored in a text file named marks.txt. Download the data file, marks.txt from WBLE for building the list of final marks in the program. The final marks: 75B+ 79B+ 88A 96A+ 90A+ 80A 76B+ 76B+ 79B+ 76B+ 75B+ 91A+ 92A+ 82A 84A 76B+ 97A+ 93A+ 95A+ 82A 78B+ 81A 81A 82A 77B+ 75B+ 85A 63B 67B 71B+ 73B+ 73B+ 72B+ 68B 74B+ 69B 73B+ 68B 62B 61B 68B 70B+ 66B 61B 62B 64B 62B 71B+ • Listing the final marks with associated grades After building the list of final marks in the program, all the final marks and…
The purpose is to write a program with 2D arrays that will display Knight's Tour. Knight's Tour is a fascinating problem that is done on an electronic chessboard with a knight. Starting at any location on the chessboard, a knight proceeds to move on the board in such a manner that all positions on the chessboard are visited, once and once only. The knight may only move according to the rules of chess playing. The matrixes below show a sequence of knight moves that starts from the top-left corner. In most cases, the knight is locked in place and can go no farther. Note: there are only 3 legal knight moves from the 44 locations and they have already been visited. 01 60 39 34 31 18 09 6438 35 32 61 10 63 30 1759 02 37 40 33 28 19 0836 49 42 27 62 11 16 2943 58 03 50 41 24 07 2048 51 46 55 26 21 12 1557 44 53 04 23 14 25 0652 47 56 45 54 05 22 13 01 22 39 20 03 18 09 1600 37 02 23 08 15 04 1335 40 21 38 19 12 17 1000 00 36 41 24 07 14 0500 34 00 32 00 28 11 2600 00 00 00 42 25 06 2900…