EBK BIG JAVA: EARLY OBJECTS, INTERACTIV
EBK BIG JAVA: EARLY OBJECTS, INTERACTIV
6th Edition
ISBN: 8220102010314
Author: Horstmann
Publisher: YUZU
Question
Book Icon
Chapter 7, Problem 5PP
Program Plan Intro

Magic Squares

Program plan:

Filename: “Square.java”

This program file is used to define a class “Square”. In the code,

  • Define a class “Square”.
    • Declare the class members “numbers”, “square” and “size”.
    • Define constructor “Square()”.
      • Initialize “numbers”.
    • Define a method “add()”,
      • Call a method “add()” to add elements to “numbers”.
    • Define a method “rowSum()”,
      • Declare a variable “sum”.
      • Iterate a “for” loop,
        • Calculate the row sum and store it in “sum”.
          • Return the value in “sum”.
    • Define a method “columnSum()”,
      • Declare a variable “sum”.
      • Iterate a “for” loop,
        • Calculate the column sum and store it in “sum”.
          • Return the value in “sum”.
    • Define a method “diagonalSum()”,
      • Declare a variable “sum”.
      • Iterate a “for” loop,
        • Declare a variable “j”.
        • If true,
          • Set “j” equal to “i”.
        • If false,
          • Set the value of “j”.
        • Calculate the diagonal sum and store it in “sum”.
            • Return the value in “sum”.
    • Define a method “isMagic()”.
      • Calculate the square root of size of “numbers” and store it in “size”.
      • If square of “size” is not equal to size of “numbers”,
        • Return “false”.
      • Iterate loops,
        • Set the value of “square[i][j]”.
      • Iterate a “for” loop,
        • If index of “n” is equal to -1,
          • Return “false”.
        • Calculate the sum using “diagonalSum()”.
          • If “sum != diagonalSum(false)” is true,
            • §  Return “false”.
          • Iterate a “for” loop,
            • §  If “sum” not equal to “rowSum(i)”,
              • ·        Return “false”.
            • §  If “sum” not equal to “columnSum(i)”,
              • ·         Return “false”.
          • Return “true”.

Filename: “MagicSquareDemo.java”

This program file is used to define a class “MagicSquareDemo”. In the code,

  • Import the required packages.
  • Define a class “MagicSquareDemo”.
    • Define the method “main()”.
      • Define the object “in” of class “Scanner”.
      • Define the object “sq” of class “Square”.
      • Prompt the user to enter the sequence of integers.
      • Iterate a “while” loop,
        • Add the element to “sq” using “add()” method.
      • Call “isMagic()” on “sq” and if the result is true,
        • Print that it is magic square.
      • If the result is false,
        • Print that it is not magic square.

Blurred answer
Students have asked these similar questions
You were requested to design IP addresses for the following network using the address block 10.10.10.0/24. Specify an address and net mask for each network and router interface
For the following network, propose routing tables in each of the routers R1 to R5
For the following network, propose routing tables in each of the routers R1 to R5

Chapter 7 Solutions

EBK BIG JAVA: EARLY OBJECTS, INTERACTIV

Ch. 7.2 - Prob. 11SCCh. 7.2 - Prob. 12SCCh. 7.3 - Prob. 13SCCh. 7.3 - Prob. 14SCCh. 7.3 - Prob. 15SCCh. 7.3 - Prob. 16SCCh. 7.3 - Prob. 17SCCh. 7.3 - Prob. 18SCCh. 7.3 - Prob. 19SCCh. 7.4 - Prob. 20SCCh. 7.4 - Prob. 21SCCh. 7.4 - Prob. 22SCCh. 7.4 - Prob. 23SCCh. 7.4 - Prob. 24SCCh. 7.5 - Prob. 25SCCh. 7.5 - Prob. 26SCCh. 7.5 - Prob. 27SCCh. 7.5 - Prob. 28SCCh. 7.5 - Prob. 29SCCh. 7.6 - Prob. 30SCCh. 7.6 - Prob. 31SCCh. 7.6 - Prob. 32SCCh. 7.6 - Prob. 33SCCh. 7.6 - Prob. 34SCCh. 7.7 - Declare an array list of integers called primes...Ch. 7.7 - Prob. 36SCCh. 7.7 - Prob. 37SCCh. 7.7 - Prob. 38SCCh. 7.7 - Prob. 39SCCh. 7.7 - Prob. 40SCCh. 7.7 - Prob. 41SCCh. 7.8 - Prob. 42SCCh. 7.8 - Prob. 43SCCh. 7.8 - Prob. 44SCCh. 7 - Prob. 1RECh. 7 - Prob. 2RECh. 7 - Write a program that contains a bounds error. Run...Ch. 7 - Write a loop that reads ten numbers and a second...Ch. 7 - Prob. 5RECh. 7 - Consider the following array: int[] a = { 1, 2, 3,...Ch. 7 - Consider the following array: int[] a = { 1, 2, 3,...Ch. 7 - Prob. 8RECh. 7 - Write Java code for a loop that simultaneously...Ch. 7 - What is wrong with each of the following code...Ch. 7 - Write enhanced for loops for the following...Ch. 7 - Rewrite the following loops without using the...Ch. 7 - Rewrite the following loops using the enhanced for...Ch. 7 - What is wrong with each of the following code...Ch. 7 - For the operations on partially filled arrays...Ch. 7 - Trace the flow of the loop in Section 7.3.4 with...Ch. 7 - Prob. 17RECh. 7 - Prob. 18RECh. 7 - Trace the algorithm for removing an element...Ch. 7 - Give pseudocode for an algorithm that rotates the...Ch. 7 - Prob. 21RECh. 7 - Suppose values is a sorted array of integers. Give...Ch. 7 - A run is a sequence of adjacent repeated values....Ch. 7 - What is wrong with the following method that aims...Ch. 7 - You are given two arrays denoting x- and...Ch. 7 - Solve the quiz score problem described in Section...Ch. 7 - Prob. 27RECh. 7 - Develop an algorithm for finding the most...Ch. 7 - Write Java statements for performing the following...Ch. 7 - Prob. 30RECh. 7 - Section 7.7.7 shows that you must be careful about...Ch. 7 - True or false? All elements of an array are of the...Ch. 7 - How do you perform the following tasks with array...Ch. 7 - Prob. 34RECh. 7 - Prob. 35RECh. 7 - Prob. 36RECh. 7 - Write a program that initializes an array with ten...Ch. 7 - Modify the LargestInArray.java program in Section...Ch. 7 - Write a method sumWithoutSmallest that computes...Ch. 7 - Add a method removeMin to the Student class of...Ch. 7 - Prob. 5PECh. 7 - Write a method that reverses the sequence of...Ch. 7 - Write a program that produces ten random...Ch. 7 - Write a method that implements the algorithm...Ch. 7 - Prob. 9PECh. 7 - Prob. 10PECh. 7 - Consider the following class: public class...Ch. 7 - Add a method public boolean sameValues(Sequence...Ch. 7 - Add a method public boolean sameValues(Sequence...Ch. 7 - Prob. 14PECh. 7 - Prob. 15PECh. 7 - Add a method to the Table class below that...Ch. 7 - Given the Table class of Exercise E7.16, add a...Ch. 7 - Prob. 18PECh. 7 - Prob. 19PECh. 7 - Prob. 20PECh. 7 - Improve the program of Exercise E7.17 by adding...Ch. 7 - Consider the following class: public class...Ch. 7 - Prob. 23PECh. 7 - Prob. 24PECh. 7 - Prob. 1PPCh. 7 - Prob. 2PPCh. 7 - Prob. 3PPCh. 7 - Prob. 4PPCh. 7 - Prob. 5PPCh. 7 - Prob. 6PPCh. 7 - Prob. 7PPCh. 7 - Prob. 8PPCh. 7 - Prob. 9PPCh. 7 - Prob. 10PPCh. 7 - A pet shop wants to give a discount to its clients...Ch. 7 - Prob. 12PPCh. 7 - Prob. 13PPCh. 7 - Prob. 14PPCh. 7 - Prob. 15PPCh. 7 - Prob. 16PPCh. 7 - Prob. 17PPCh. 7 - Prob. 18PPCh. 7 - Prob. 19PPCh. 7 - Prob. 20PPCh. 7 - Prob. 21PPCh. 7 - Prob. 22PPCh. 7 - Prob. 23PPCh. 7 - Prob. 24PPCh. 7 - Prob. 25PP
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education