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

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

Write a program that accepts two integer values, called "arraySize" and "multiplier", as user input. Create an array of integers with arraySize elements. Set each array element to the value i*multiplier, where i is the element's index. Next create two functions, called PrintForward() and PrintBackward(), that each accept two parameters: (a) the array to print, (b) the size of the array. The PrintForward() function should print each integer in the array, beginning with index 0. The PrintBackward() function should print the array in reverse order, beginning with the last element in the array and concluding with the element at index 0. As output, print the array once forward and once backward.
Test the Baby class below by writing a client program which uses an array to storeinformation about 4 babies. That is, each of the four elements of the arraymust store a Baby object.If you have an array for baby names and another array for baby ages,then you have missed the point of the exercise and therefore not metthe requirement of this exercise.A Baby class object stores the required information about a Baby. Soeach Baby object will have its own relevant information, and thus eachobject must be stored in one element of the array.The client program should:a. Enter details for each baby (name and age) and thus populate theBaby arrayb. Output the details of each baby from the array (name and age)c. Calculate and display the average age of all babies in the arrayd. Determine whether any two babies in the array are the sameAs the required information for these tasks is stored in the Baby array, youwill need to use a loop to access each array element (and use the dot notationto access…
Write a Java application to simulate the rolling of two dice. The application should use an object of class Random once to roll the first die and again to roll the second die. The sum of the two values should then be calculated. Each die can show an integer value from 1 to 6, so the sum of the values will vary from 2 to 12, with 7 being the most frequent sum, and 2 and 12 the least frequent.Your application should roll the dice 12 times. Use a one-dimensional array to tally the number of times each possible sum appears. Display the results in tabular format. */
write a cilent program for a class that reads up to 100 data of charter flights from the file whose name is obtained form the user, stores them in an array, then displays all the records along with the revenue amounts, and then allows the user to search and display charter flights by the name of the buyer, until user enters a sentinel.
Can you fix my code? I am still having 1 senators as it should be 2 because there are 2 senator position on the array. I think its the loop I am wrong thank you <body> <?php $candidates = [ ['name' => 'Allan', 'position' => 'President'], ['name' => 'Rhea', 'position' => 'Vice President'], ['name' => 'Jane', 'position' => 'Senator'], ['name' => 'Jfafa', 'position' => 'Senator'], ]; $counterPresident = 0; $counterVicePresident = 0; $counterSenator = 0; switch($candidates as $p) { case "1" ($p['position'] == "President") { ++$counterPresident; } else if($p['position'] == "Vice President") { ++$counterVicePresident; } else if($p['position'] == "Senator") { ++$counterSenator; } } echo "Presidents: ". $counterPresident ." candidates"; echo "<br>"; echo "Vice President: ". $counterVicePresident ." candidates"; echo…
Write your own array library named “my_array_library.h” with two-dimensional arrayincluding the following functions and create a project and test these functions with“main.c”.- Enter the elements of an array- Print the elements of an array- Print the mth, nth element of an array
Write a function called remove_punct() that accepts an array of characters and the number of items in the array as parameters, removes the punctuation (',', '!', '.') characters from the array, and returns the number of punctuation characters removed. For example, if the array contains ['C', 'p', 't', 'S', ',', '1', '2', '1', '.', 'i', 's', 'f', 'u', 'n', '!'], then the function should remove the punctuation characters. The function must remove the characters by shifting all characters to the right of each punctuation character, left by one spot in the array. This will overwrite the punctuation characters, resulting in: ['C', 'p', 't', 'S', '1', '2', '1', 'i', 's', 'f', 'u', 'n']. In this case, the function returns 3. Note: if the array does not contain any punctuation characters, then the array is unchanged and the function returns 0.
Write a program to ask the user for the number of arrays he wants to maintain and then populate eacharray by taking elements from the user. Merge all these arrays in another array and finally remove duplicateelements from the merged array.
Write a small piece of pseudo-code for generating a histogram H[L] for an intensity image I[YDIM][XDIM], where L is the total level of intensities of the image, H is the histogram array, XDIM * YDIM are the size of the image, and I[i][j] is the intensity value of the pixel at location (i,j), with i = 1, …, YDIM, and j = 1,…, XDIM. You might choose to use a certain program language that you are familiar with to write the code. You don’t have to compile the code.
Write a helper method, with the signature eliminateZerosinArray[int[]): int[], that takes a single dimensional int array as an argument, and returns a new array that only contains the original values that are not equal to 0. The returned array may be the same size or smaller depending on whether there are values that are equal to 0 in the original array. You may only use standard intl| arrays to solve this.
Write a Program for insertion and deletion from an array without replacement of element from the arrays. Also, write a program to search the array for the presence of a given element from an array. Write the sub-functions in the provided test case in text form and upload the same. #include<stdio.h> #include<stdlib.h> int cmpfunc (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int insert_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of insertion, x: element to insert*/ /*output:-1 indication error or 0 if successful /* write the function for inserting element into a position*/ } int delete_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of deletion, x: element to deletion*/ /*output:-1 indication error or 0 if successful /* write the function for delete element into a position*/ } int linear_search_function(int *data, int n, int x) { /*write the function to…
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…