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

This is a question that I have and would like someone who has experiences with scene graphs and entity component systems to answer.For context, I am currently implementing a game engine and currently I am debating on our current design.Our current design is we have a singular game component class that every component inherits from. Where we have components like SpriteRendererComponent, Mehs Component, etc. They inherit from this GameComponent class. The point of this is being able to have O(1) access to the scene to being able to modify components to attach more components with the idea of accessing those components to specific scene objects in a scene.Now, my question is what kinds of caveauts can this cause in terms of cache coherence? I am well aware that yes its O(1) and that is great but cache coherence is going to be really bad, but would like to know more explicit details and real-life examples such as write in RAM examples on how this is bad. A follow-up question that is part…

Q4: Consider the following MAILORDER relational schema describing the data for a mail order company. (Choose five only). PARTS(Pno, Pname, Qoh, Price, Olevel) CUSTOMERS(Cno, Cname, Street, Zip, Phone) EMPLOYEES(Eno, Ename, Zip, Hdate) ZIP CODES(Zip, City) ORDERS(Ono, Cno, Eno, Received, Shipped) ODETAILS(Ono, Pno, Qty) (10 Marks) I want a detailed explanation to understand the mechanism how it is Qoh stands for quantity on hand: the other attribute names are self-explanatory. Specify and execute the following queries using the RA interpreter on the MAILORDER database schema. a. Retrieve the names of parts that cost less than $20.00. b. Retrieve the names and cities of employees who have taken orders for parts costing more than $50.00. c. Retrieve the pairs of customer number values of customers who live in the same ZIP Code. d. Retrieve the names of customers who have ordered parts from employees living in Wichita. e. Retrieve the names of customers who have ordered parts costing less…

Q4: Consider the following MAILORDER relational schema describing the data for a mail order company. (Choose five only). (10 Marks) PARTS(Pno, Pname, Qoh, Price, Olevel) CUSTOMERS(Cno, Cname, Street, Zip, Phone) EMPLOYEES(Eno, Ename, Zip, Hdate) ZIP CODES(Zip, City) ORDERS(Ono, Cno, Eno, Received, Shipped) ODETAILS(Ono, Pno, Qty) Qoh stands for quantity on hand: the other attribute names are self-explanatory. Specify and execute the following queries using the RA interpreter on the MAILORDER database schema. a. Retrieve the names of parts that cost less than $20.00. b. Retrieve the names and cities of employees who have taken orders for parts costing more than $50.00. c. Retrieve the pairs of customer number values of customers who live in the same ZIP Code. d. Retrieve the names of customers who have ordered parts from employees living in Wichita. e. Retrieve the names of customers who have ordered parts costing less than$20.00. f. Retrieve the names of customers who have not placed…