Question

You are to write a class called AssignmentsRecursion. In the class, you will write 3 public methods (described below). The squares puzzle problem: “How many one-by-one squares will be generated by an algorithm that starts with a single square and, on each iteration, adds squares all around the outside.” n=0 n=1 n=2 etc. The answer to this puzzle can be described three different ways. You are to write three static methods that implement the following public methods: 1) A static method called puzzleFormula(int n), which returns an integer that is the number of squares. You should use the following formula to calculate it: 2n2 + 2n + 1 2) A static method called puzzleLoop(int n), which returns an integer that is the number of squares. You should use a loop to implement the following formula:_(2n+ 1) + 2%",2i – 1) 3) A static method called puzzleRecurse(int n), which returns an integer that is the number of squares. You should implement it recursively using the following formula: S(O)= 1 S(n) = S(n-1) + 4n for n>=1 Testing your program: you can use either the “console” driver program or the “graphical” driver program for testing. Obviously, you should come out with the same answers on every method. It is also possible to create your own main method inside of Assignment5Recursion.java and use it for testing. Comments and formatting: Please use the Java conventions for variable names, indenting, and formatting. Each class should have an opening comment which briefly describes the class and includes your name and class on a separate line. Each method should have a short opening comment which describes it. "Sections” of code or parts that are tricky should have comments. See programs from the book for examples (although I prefer that opening and closing "squigglies" be indented the same).

Example Output:

$0 X 6. C:\WINDOWS\system32\cmd.exe puzzleFornula(1) returns: 5 puzzleLoop(1) returns: 5 puzzle Recurse (1) returns: 5 puzzleF$

STARTING CODE:

Assignment5RecursionConsoleDriver.java:

import java.io.*;

public class Assignment5RecursionConsoleDriver
{
   public static void main(String[] args) throws IOException
   {
       System.out.println("puzzleFormula(1) returns: " + Assignment5Recursion.puzzleFormula(1));
       System.out.println("puzzleLoop(1) returns: " + Assignment5Recursion.puzzleLoop(1));
       System.out.println("puzzleRecurse(1) returns: " + Assignment5Recursion.puzzleRecurse(1));

       System.out.println("\npuzzleFormula(2) returns: " + Assignment5Recursion.puzzleFormula(2));
       System.out.println("puzzleLoop(2) returns: " + Assignment5Recursion.puzzleLoop(2));
       System.out.println("puzzleRecurse(2) returns: " + Assignment5Recursion.puzzleRecurse(2));

       System.out.println("\npuzzleFormula(3) returns: " + Assignment5Recursion.puzzleFormula(3));
       System.out.println("puzzleLoop(3) returns: " + Assignment5Recursion.puzzleLoop(3));
       System.out.println("puzzleRecurse(3) returns: " + Assignment5Recursion.puzzleRecurse(3));

       System.out.println("\npuzzleFormula(7) returns: " + Assignment5Recursion.puzzleFormula(7));
       System.out.println("puzzleLoop(7) returns: " + Assignment5Recursion.puzzleLoop(7));
       System.out.println("puzzleRecurse(7) returns: " + Assignment5Recursion.puzzleRecurse(7));
   }
}

Assignment5RecursionGraphicDriver.java:

//This program produces a GUI for the squares puzzle problem. The user puts
//in the iteration and it produces a graph and calls/displays the formula, loop, and
//recursive solutions.

import java.awt.*;
import java.awt.Color;
import java.awt.event.*;
import javax.swing.*;
import javax.swing.event.*;

public class Assignment5RecursionGraphicDriver extends JFrame //implements ActionListener
{
   public Assignment5RecursionGraphicDriver()
   {
setTitle("CSC205AB Assignment5Recursion Display");
setSize(430, 400);
setLocation(50,50);
Container contentPane = getContentPane();

   final JTextField iterationText = new JTextField(5);

JButton jbtGraph = new JButton("Graph");

final JPanel panel = new JPanel();
   final JPanel inputPanel = new JPanel(new GridLayout(2,5));
   Label iterationLabel = new Label("Iteration",Label.CENTER);
   inputPanel.add(iterationLabel,0);
   Label formulaLabel = new Label("Formula result",Label.CENTER);
   inputPanel.add(formulaLabel,1);
   Label loopLabel = new Label("Loop result",Label.CENTER);
   inputPanel.add(loopLabel,2);
   Label recursionLabel = new Label("Recursion result",Label.CENTER);
   inputPanel.add(recursionLabel,3);
   inputPanel.add(iterationText,4);

   final Label formulaResultLabel = new Label("",Label.CENTER);
   inputPanel.add(formulaResultLabel,5);
   final Label loopResultLabel = new Label("",Label.CENTER);
   inputPanel.add(loopResultLabel,6);
   final Label recursionResultLabel = new Label("",Label.CENTER);
   inputPanel.add(recursionResultLabel,7);

   contentPane.add(inputPanel, BorderLayout.SOUTH);
contentPane.add(panel, BorderLayout.CENTER);
contentPane.add(jbtGraph, BorderLayout.NORTH);

setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
setVisible(true);

jbtGraph.addActionListener(new ActionListener()
{
public void actionPerformed(ActionEvent event)
{
//set up the Graphics
Graphics g = panel.getGraphics();
           g.setColor(Color.BLUE);
           g.clearRect(0,0,panel.getWidth(), panel.getHeight());

           //find various dimensions for the panel
           int n=Integer.parseInt(iterationText.getText());
           int maxrows = 2*n + 1;
           int middlex = panel.getWidth()/2;
           int middley = panel.getHeight()/2;
           int smallerDimension = Math.min(panel.getHeight(), panel.getWidth());
           int squaresize = Math.min(60, smallerDimension/maxrows);
           int ystart = middley - (maxrows*squaresize)/2 - squaresize;
           int xstart = middlex - squaresize/2 + squaresize;

           int numinrow = -1; //to start

           for (int row=1; row<=maxrows; row++)
           {
               if (row<=(maxrows+1)/2)       //up to and including middle (longest) row
               {
                   numinrow += 2;           //each row has 2 more squares than prev. row
                   ystart += squaresize;
                   xstart -= squaresize;
                   for (int j=0; j<numinrow; j++) //draw each square in the row
                   {
                       g.drawRect(xstart+j*squaresize, ystart, squaresize, squaresize);
                   }

               }
               else                       //lower half
               {
                   numinrow -= 2;           //each row has 2 less than prev. row
                   ystart += squaresize;
                   xstart += squaresize;
                   for (int j=0; j<numinrow; j++)   //draw each square in the row
                   {
                       g.drawRect(xstart+j*squaresize, ystart, squaresize, squaresize);
                   }

               }

           }

           //call the puzzle methods to get results; display them
           formulaResultLabel.setText("" + Assignment5Recursion.puzzleFormula(n));
           loopResultLabel.setText("" + Assignment5Recursion.puzzleLoop(n));
           recursionResultLabel.setText("" + Assignment5Recursion.puzzleRecurse(n));
}
}
);

   }

   public static void main(String[] args)
   {
       //create a new instance
       Assignment5RecursionGraphicDriver myDriver = new Assignment5RecursionGraphicDriver();
       myDriver.setVisible(true);

   }
}

Answer 1

Please find the answer below.
Please do comments in case of any issue. Also, don't forget to rate the question. Thank You.

Assignment5RecursionGraphicDriver.java

package c8;

//This program produces a GUI for the squares puzzle problem. The user puts
//in the iteration and it produces a graph and calls/displays the formula, loop, and
//recursive solutions.
import java.awt.BorderLayout;
import java.awt.Color;
import java.awt.Container;
import java.awt.Graphics;
import java.awt.GridLayout;
import java.awt.Label;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;

import javax.swing.JButton;
import javax.swing.JFrame;
import javax.swing.JPanel;
import javax.swing.JTextField;

class Assignment5Recursion{

   public static int puzzleFormula(int n) {
       return 2*n*n + 2*n + 1;
   }

   public static int puzzleLoop(int n) {
       int sum = 2*n + 1;
      
       for (int i = 1; i <= n; i++) {
           sum += 2*(2*i-1);
       }
       return sum;
   }

   public static int puzzleRecurse(int n) {
           if(n==0){
               return 1;
           }else{
               return puzzleRecurse(n-1) + 4*n;
           }
   }
}

public class Assignment5RecursionGraphicDriver extends JFrame //implements ActionListener
{
   public Assignment5RecursionGraphicDriver()
   {
       setTitle("CSC205AB Assignment5Recursion Display");
       setSize(430, 400);
       setLocation(50,50);
       Container contentPane = getContentPane();

       final JTextField iterationText = new JTextField(5);

       JButton jbtGraph = new JButton("Graph");

       final JPanel panel = new JPanel();
       final JPanel inputPanel = new JPanel(new GridLayout(2,5));
       Label iterationLabel = new Label("Iteration",Label.CENTER);
       inputPanel.add(iterationLabel,0);
       Label formulaLabel = new Label("Formula result",Label.CENTER);
       inputPanel.add(formulaLabel,1);
       Label loopLabel = new Label("Loop result",Label.CENTER);
       inputPanel.add(loopLabel,2);
       Label recursionLabel = new Label("Recursion result",Label.CENTER);
       inputPanel.add(recursionLabel,3);
       inputPanel.add(iterationText,4);

       final Label formulaResultLabel = new Label("",Label.CENTER);
       inputPanel.add(formulaResultLabel,5);
       final Label loopResultLabel = new Label("",Label.CENTER);
       inputPanel.add(loopResultLabel,6);
       final Label recursionResultLabel = new Label("",Label.CENTER);
       inputPanel.add(recursionResultLabel,7);

       contentPane.add(inputPanel, BorderLayout.SOUTH);
       contentPane.add(panel, BorderLayout.CENTER);
       contentPane.add(jbtGraph, BorderLayout.NORTH);

       setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
       setVisible(true);

       jbtGraph.addActionListener(new ActionListener()
       {
           public void actionPerformed(ActionEvent event)
           {
               //set up the Graphics
               Graphics g = panel.getGraphics();
               g.setColor(Color.BLUE);
               g.clearRect(0,0,panel.getWidth(), panel.getHeight());

               //find various dimensions for the panel
               int n=Integer.parseInt(iterationText.getText());
               int maxrows = 2*n + 1;
               int middlex = panel.getWidth()/2;
               int middley = panel.getHeight()/2;
               int smallerDimension = Math.min(panel.getHeight(), panel.getWidth());
               int squaresize = Math.min(60, smallerDimension/maxrows);
               int ystart = middley - (maxrows*squaresize)/2 - squaresize;
               int xstart = middlex - squaresize/2 + squaresize;

               int numinrow = -1; //to start

               for (int row=1; row<=maxrows; row++)
               {
                   if (row<=(maxrows+1)/2) //up to and including middle (longest) row
                   {
                       numinrow += 2; //each row has 2 more squares than prev. row
                       ystart += squaresize;
                       xstart -= squaresize;
                       for (int j=0; j<numinrow; j++) //draw each square in the row
                       {
                           g.drawRect(xstart+j*squaresize, ystart, squaresize, squaresize);
                       }

                   }
                   else //lower half
                   {
                       numinrow -= 2; //each row has 2 less than prev. row
                       ystart += squaresize;
                       xstart += squaresize;
                       for (int j=0; j<numinrow; j++) //draw each square in the row
                       {
                           g.drawRect(xstart+j*squaresize, ystart, squaresize, squaresize);
                       }

                   }

               }

               //call the puzzle methods to get results; display them
               formulaResultLabel.setText("" + Assignment5Recursion.puzzleFormula(n));
               loopResultLabel.setText("" + Assignment5Recursion.puzzleLoop(n));
               recursionResultLabel.setText("" + Assignment5Recursion.puzzleRecurse(n));
           }
       }
               );

   }

   public static void main(String[] args)
   {
       //create a new instance
       Assignment5RecursionGraphicDriver myDriver = new Assignment5RecursionGraphicDriver();
       myDriver.setVisible(true);

   }
}

Edit couco Defactor Navista Concel Nicoiset Window Helg X CSC205AB AssignmentsRecu... Graph r.java X Iteration Formula result Recursion result mula (i Loop result 3 25 25 25 27

CSC205AB Assignment5Recu... Х A Graph Iteration Formula result Loop result Recursion result 24 1201 1201 1201