Lo Shu Magic Square Program Plan: Import the required packages. Declare the class “Main”. Declare the “main ()” method. Declare two 2-Dimensional arrays. Call the function “show_Array ()” to display the array. Call the function “show_Result ()” to display the result. Give function definition for “show_Result ()”. Check if the square is a magic square by calling the function “isMagicSquare ()”. If yes, then print the positive message. Else, Print the negative message. Give function definition for “show_Array ()” to display the array. Using nested “for” loops, print the values of the array. Give function definition for “isMagicSquare ()”. Declare a Boolean variable. Call the function “check_Range ()”, “checkUnique ()”, “checkRowSum ()”, “check_ColSum ()”, and “check_DiagSum ()”. Check the condition “is_InRange && is_Unique && is_EqualRows &&is_EqualCols && is_EqualDiag”. Assign “true” to the Boolean variable. Return the variable. Give function definition for “check_Range ()”. Declare required variables. Using nested “for” loops, check the condition “array[row][col] < MIN || array[row][col] > MAX”. Assign “false” to the Boolean variable. Return the variable. Give function definition for “check_Unique ()”. Declare required variables. Using the while condition “searchValue <= MAX && status == true”. Using nested “for” loops, Check the condition “array[row][col] == searchValue”, Increment the counter variable. Check if count value is greater than 1. Assign “false” to the Boolean variable. Increment the variable “searchValue”. Assign 0 to the counter variable. Return the status. Give function definition for “check_RowSum ()”. Declare a variable. Calculate the sum of 1 st row, 2 nd row and 3 rd row. Check if all the values are not equal to each other. Assign “false” to the Boolean variable. Return the variable. Give function definition for “check_ColSum ()”. Declare a variable. Calculate the sum of 1 st column, 2 nd column and 3 rd column. Check if all the values are not equal to each other. Assign “false” to the Boolean variable. Return the variable. Give function definition for “check_DiagSum ()”. Declare a variable. Calculate the sum of 1 st diagonal, and 2 nd diagonal. Check if all the values are not equal to each other. Assign “false” to the Boolean variable. Return the variable.

Question

Want to see the full answer?

Answer 1

Question

Chapter 7, Problem 20PC

Program Plan Intro

Lo Shu Magic Square

Program Plan:

Import the required packages.

Declare the class “Main”.

Declare the “main ()” method.

Declare two 2-Dimensional arrays.

Call the function “show_Array ()” to display the array.

Call the function “show_Result ()” to display the result.

Give function definition for “show_Result ()”.

Check if the square is a magic square by calling the function “isMagicSquare ()”.

If yes, then print the positive message.

Else,

Print the negative message.

Give function definition for “show_Array ()” to display the array.

Using nested “for” loops, print the values of the array.

Give function definition for “isMagicSquare ()”.

Declare a Boolean variable.

Call the function “check_Range ()”, “checkUnique ()”, “checkRowSum ()”, “check_ColSum ()”, and “check_DiagSum ()”.

Check the condition “is_InRange && is_Unique && is_EqualRows &&is_EqualCols && is_EqualDiag”.

Assign “true” to the Boolean variable.

Return the variable.

Give function definition for “check_Range ()”.

Declare required variables.

Using nested “for” loops, check the condition “array[row][col] < MIN || array[row][col] > MAX”.

Assign “false” to the Boolean variable.

Return the variable.

Give function definition for “check_Unique ()”.

Declare required variables.

Using the while condition “searchValue <= MAX && status == true”.

Using nested “for” loops,

Check the condition “array[row][col] == searchValue”,

Increment the counter variable.

Check if count value is greater than 1.

Assign “false” to the Boolean variable.

Increment the variable “searchValue”.

Assign 0 to the counter variable.

Return the status.

Give function definition for “check_RowSum ()”.

Declare a variable.

Calculate the sum of 1^st row, 2^nd row and 3^rd row.

Check if all the values are not equal to each other.

Assign “false” to the Boolean variable.

Return the variable.

Give function definition for “check_ColSum ()”.

Declare a variable.

Calculate the sum of 1^st column, 2^nd column and 3^rd column.

Check if all the values are not equal to each other.

Assign “false” to the Boolean variable.

Return the variable.

Give function definition for “check_DiagSum ()”.

Declare a variable.

Calculate the sum of 1^st diagonal, and 2^nd diagonal.

Check if all the values are not equal to each other.

Assign “false” to the Boolean variable.

Return the variable.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

GetMonth - This method prompts for and returns the month GetNumMurals - This method prompts for and returns the number of murals scheduled and is called twice -- once for interior murals and once for exterior murals ComputeRevenue - This method accepts the number of interior and exterior murals scheduled, accepts the month they are scheduled, displays the interior and exterior prices, and then returns the total expected revenue DataEntry - This method fills an array with customer names and mural codes and is called twice -- once to fill the array of interior murals and once to fill the array of exterior murals GetSelectedMurals - This method continuously prompts for mural codes and displays jobs of the corresponding type until a sentinel value is entered. In order to prepend the $ to currency values, the program will need to use the CultureInfo.GetCultureInfo method. in C#

A positive integer greater than 1 is said to be prime if it has no divisors other than 1 and itself. Write a program that asks the user to input an integer greater than 1, then display all of the prime numbers that less than or equal to the number entered. The program should work as follows: • Once the user has entered a number, the program should display an array with all of the integers from 2 up through the value entered. • The program should then use a loop to step through the array. The loop should pass each element to a method that displays the element whether it is prime number. Your result should look like, for example: Enter an integer greater than 1: 9 2, 3, 4, 5, 6, 7, 8, 9 2 is prime 3 is prime 4 is not prime 5 is prime 6 is not prime 7 is prime 8 is not prime 9 is not prime Using java programming

2. Rotate Left k cells Use Python Consider an array named source. Write a method/function named rotateLeft( source, k) that rotates all the elements of the source array to the left by 'k' positions. You must execute the method by passing an array and number of cells to be shifted. After calling the method, print the array to show whether the elements have been shifted properly. Example: source=[10,20,30,40,50,60] rotateLeft(source,3) After calling rotateLeft(source,3), printing the array should give the output as: [ 40, 50, 60, 10, 20, 30]