Fractal Program plan: Import required packages Define the class “Fractal”. Declare the required static variables. Define the class “main” Call the method “launch()”. Define the method “start()”. Create an object for “Group()”, “Scene()”, “Canvas()” and “GraphicsContext()”. Call the method “drawFractal()”. Set the title for the frame. Set the scene for the frame. Call the method “show()”. Define the method “drawFractal()”. Check whether “k” equals to “0”. Call the method “strokeLine()”. Otherwise, check whether “p1x” equals to “p2x”. Calculate the length. Assign the calculated length to variable “third”. Call the method to draw line in vertical order. Otherwise, calculate the length. Assign the calculated length to variable “third”. Call the method to draw line in horizontal order.

Question

Want to see the full answer?

Answer 1

Question

Chapter 11, Problem 10PP

Program Plan Intro

Fractal

Program plan:

Import required packages

Define the class “Fractal”.

Declare the required static variables.

Define the class “main”

Call the method “launch()”.

Define the method “start()”.

Create an object for “Group()”, “Scene()”, “Canvas()” and “GraphicsContext()”.

Call the method “drawFractal()”.

Set the title for the frame.

Set the scene for the frame.

Call the method “show()”.

Define the method “drawFractal()”.

Check whether “k” equals to “0”.

Call the method “strokeLine()”.

Otherwise, check whether “p1x” equals to “p2x”.

Calculate the length.

Assign the calculated length to variable “third”.

Call the method to draw line in vertical order.

Otherwise, calculate the length.

Assign the calculated length to variable “third”.

Call the method to draw line in horizontal order.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

please code in python You place a pawn at the top left corner of an n-by-n chess board, labeled (0,0). For each move, you have a choice: move the pawn down a single space, or move the pawn down one space and right one space. That is, if the pawn is at position (i,j), you can move the pawn to (i+1,j) or (i+1, j+1). Ask the user for the size of a chessboard, n (integer). Find the number of different paths starting from (0,0) that the pawn could take to reach each position on the chess board. For example, there are two different paths the pawn can take to reach (2,1). Look at the diagrams below to convince yourself of this. You can see the four paths that you can take by move 2. Start -> Move 1 -> Move 2 (0,0) -> (1,0) -> (2,1) (0,0) -> (1,0) -> (2,0) (0,0) -> (1,1) -> (2,1) (0,0) -> (1,1) -> (2,2) Print the board with the number of ways to reach each square labeled as shown below. For example: Enter a board size: 4 1 0 0 0 1 1 0 0 1 2 1 0 1 3 3 1

JavaScript Programming One day, Fred and his N friends were playing a card game in which each player throws a card with a number written on it. The cards are such that a number X is written on front of the card, and the negative of that number is written on the back side of the card. This game has the following rules: - Each of the N players is asked to throw a card. After all the N cards are thrown, Fred has to flip one or more cards in consecutive order, only orice. Your task is to help Fred flip the cards in such a way that the sum of the numbers, on front face of the cards, is the maximum. Your Task is to return the maximum sum of the numbers, on the front cards. Input Output 13 -1 2 3 4 -5

Transcribed Image Text Python Development Lab In Merworld there exists 2 coins of different denominations types 5-peso coins and 10- peso coins, both having two faces with image of – Elon Musk and a dog. You are assigned a task to find out the number of ways to arrange these coins so that their sum is N pesos. Arrangement should be done in such a way that the first coin in the arrangement should always have Elon Musk image up. Other coins could have any image. Input Output 1 60 5 LO