[Lo Shu Magic Square]The Lo Shu Magic Square is a grid with 3 rows and 3 columns. The Lo Shu Magic Square has the following properties:1. The grid contains the numbers 1 through 9 exactly.2. The sum of each row, each column, and each diagonal all add up to the same number.In a program you can simulate a magic square using a two-dimensional array. Write a function that accepts a two-dimensional array as an argument, and determines whether the array is aLo Shu Magic Square. Test the function in a program.154+15357> 15816+ 1515151515Required function header:const int COLS = 3;void showArray(const int array[][COLS], int rows); //display 2-D array contentbool checkLoShuSquare(const int array[][COLS], int rows); // check if the 2-D is a Lo Shu Square• Hint:Find the sum of the first row. If the sum of any other row or col != the sum of the first row. return false from the checkLoShuSquare() function bool validateArray(const int array[][COLS], int rows)Write a function to validate the 2D array contains the numbers 1 through 9 exactly• Sample squares (2D array) for testing purpose:int LoShu[3][COLS] = {{4, 9, 2}, {3, 5, 7}, {8, 1, 6}};int square1[3][COLS] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};int square2[3][COLS] = {{1, 4, 7}, {2, 5, 8}, {3, 6, 9}};int squareTest[3][COLS] = {0}; // test the extra credit assignment• Sample output:**Test the First Square**4237816It is a Lo Shu Magic Square!**Test the Second Square**24 5TIT13689It is NOT a Lo Shu Magic Square!**Test the Last Square**458369It is NOT a Lo Shu Magic Square!**Test the invalid Square**It is NOT a 3 x 3 array contained the numbers 1~9 exactly.It is NOT a Lo Shu Magic Square!Requirements:1. Use nested for-loop to find the sum of each row and column.2. DON'T compare each sum == 15. DON'T assume the desired total is 15.3. Display the programmer info at the beginning of the output4. Include the function prototypes before the main()5. All functions definitions should be after the main()

import java.util.*;import java.lang.*;import java.io.*; class LoShuMagicSquare{ public static void…

Lo Shu Magic Square) The Lo Shu Magic Square is a grid with 3 rows and 3 columns. The Lo Shu Magic Square has the following properties: 1. The grid contains the numbers 1 through 9 exactly. 2. The sum of each row, each column, and each diagonal all add up to the same number. in a program you can simulate a magic square using a two-dimensional array. Write a function that accepts a two-dimensional array as an argument, and determines whether the array is a Lo Shu Magic Square. Test the function in a program. 15 9 2 3 7 + 15 8 1 6 +15 15 15 15 15 • Required function header: const int COLS - 3; void showArray(const int array[[COLS], int rows); //display 2-D array content bool checkLoShuSquare(const int array[][COLS], int rows); // check if the 2-D is a Lo Shu Square Hint

Lo Shu Magic Square) The Lo Shu Magic Square is a grid with 3 rows and 3 columns. The Lo Shu Magic Square has the following properties: 1. The grid contains the numbers 1 through 9 exactly. 2. The sum of each row, each column, and each diagonal all add up to the same number. in a program you can simulate a magic square using a two-dimensional array. Write a function that accepts a two-dimensional array as an argument, and determines whether the array is a Lo Shu Magic Square. Test the function in a program. 15 9 2 3 7 + 15 8 1 6 +15 15 15 15 15 • Required function header: const int COLS - 3; void showArray(const int array[[COLS], int rows); //display 2-D array content bool checkLoShuSquare(const int array[][COLS], int rows); // check if the 2-D is a Lo Shu Square Hint

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 23PE

See similar textbooks

Similar questions

(Numerical) Given a one-dimensional array of integer numbers, write and test a function that displays the array elements in reverse order.
(Numerical) a. Define an array with a maximum of 20 integer values, and fill the array with numbers input from the keyboard or assigned by the program. Then write a function named split() that reads the array and places all zeros or positive numbers in an array named positive and all negative numbers in an array named negative. Finally, have your program call a function that displays the values in both the positive and negative arrays. b. Extend the program written for Exercise 6a to sort the positive and negative arrays into ascending order before they’re displayed.
(Electrical eng.) a. An engineer has constructed a two-dimensional array of real numbers with three rows and five columns. This array currently contains test voltages of an amplifier. Write a C++ program that interactively inputs 15 array values, and then determines the total number of voltages in these ranges: less than 60, greater than or equal to 60 and less than 70, greater than or equal to 70 and less than 80, greater than or equal to 80 and less than 90, and greater than or equal to 90. b. Entering 15 voltages each time the program written for Exercise 7a runs is cumbersome. What method could be used for initializing the array during the testing phase? c. How might the program you wrote for Exercise 7a be modified to include the case of no voltage being present? That is, what voltage could be used to indicate an invalid voltage, and how would your program have to be modified to exclude counting such a voltage?
Write a function named(Count_elements), that accepts a one-dimensional array and its size, returns how many elements of the array divisible by 3 and by 2. e.g. the array is [1,7,13,22,15,6,4,3,2,9,21] the output is:2
Write a function named(difference), that accepts an integer one-dimensional array and its size, returns the difference between the largest element and the smallest element. e.g. the array is [1,7,13,22,15,6,4,3,2,9,21] the output is:21
5. Write a function which will find the average of all elements of an array of integers. Pass an array and a dimension (the number of elements), and return the value of the average as a float ( the return value). Test this function in the main program with the array: 5, 7, 3, 5, 6, 4.
Write a function that returns an integer that appears most often with respect to an array of integers In the array. for example. [1 2 3 2 3 4 2 5] For an array your function must return 2.
Given an array of integers, write a function to find the second largest number in the array. The function should return -1 if the array has less than two elements. Function signature: int second_largest(int arr[], int size) Example: Input: arr = [1, 2, 3, 4, 5], size = 5 Output: 4 Input: arr = [1], size = 1 Output: -1 Notes: The function should work for arrays of any size. You can assume that the elements of the array are unique and not sorted in any particular order. This problem requires the use of loops, conditional statements, and basic array operations, and it can be solved using a variety of algorithms. A brute-force approach would be to compare each element with all other elements in the array to find the largest and second largest numbers, but this would have a time complexity of O(n^2). A more efficient solution would be to use a single loop to iterate through the array, updating the values of the largest and second largest numbers as needed.
Create a function that takes two numbers as arguments (num, length) and returns an array of multiples of num until the array length reaches length.
Write a function that determines who has won a game of tic-tac-toe. The function should receive a character array containing the moves of tic-tac-toe game as given below. first check all rows to see whether one player occupies all the cells in one row, next check all columns, and then check the two diagonals. The function should return a value of 1, 0, -1 in case player 1 wins, draw and player 2 wins, respectively. Assume player 1 marks ‘o’ and player 2 marks ‘x’. Assume, the position for no-move contains ‘ ’ (space character). Use C language to code above problem...
Write a function that takes as input an array of (type float) 5 numbers and prints the positionand the value of the smallest number.For example, for an array A = [-2.3, 0.8, 1.7, 1.1, -5.2], the function should print: The minimumvalue of the array is -5.2 and is stored at position 5.Write a program that asks the user to enter 5 numbers to populate the array, and then calls thefunction described above.
Write a function that takes 3 arguments, all integers. // It returns an array starting with the first number and increasing by the interval until it reaches // the second number, including the second number if it is part of the pattern. // For this exercise you can assume that the first integer is strictly less than the second integer. const countWithIntervals = (start, end, interval) => { } // Examples countWithIntervals(1, 10, 2) // returns [1, 3, 5, 7, 9] countWithIntervals(5, 20, 3) // returns [5, 8, 11, 14, 17, 20] // Write a function that takes 2 arguments, both strings. // It returns as a number how many times the second string occurs within the first string. const subStringCount = (string, subString) => { } // Examples subStringCount("mississippi", "i") // returns 4 subStringCount("lions and tigers and bears", "and") // returns 2