Adding “Target” class to Cannonball animation Program Plan: Tracker.py: Import the required packages. Definition of class “Tracker”. Condition to show the ball in the window. Create an object to report the current position. Condition to track the X and Y position. Calling the Point using the position. Determining the size. Call the method Circle. Definition of method “initializeTracker ()”. Get the size of the ball. Setting the color of the ball. Draw the window. Definition of method “move”. Tracking the current position. Call the method Point by passing the parameter. Call the method “initializeTracker()”. Definition of “getPosition()”. Return the center value Main.py: Import the require packages. Definition of method “main()”. Create an interface. Call the method “Tracker()”. Create the button “X”. Activate the button. Call the “Point()” by passing the arguments Check the condition whether the “target” is clicked. Call the update method. Get the “x” and “y” position. Move the ball. Print the current position. Check whether “dy” is less than 0. Print the angle, velocity, initial height. Call the main method.

Question

Want to see the full answer?

Answer 1

Question

Chapter 10, Problem 16PE

Program Plan Intro

Adding “Target” class to Cannonball animation

Program Plan:

Tracker.py:

Import the required packages.

Definition of class “Tracker”.

Condition to show the ball in the window.

Create an object to report the current position.

Condition to track the X and Y position.

Calling the Point using the position.

Determining the size.

Call the method Circle.

Definition of method “initializeTracker ()”.

Get the size of the ball.

Setting the color of the ball.

Draw the window.

Definition of method “move”.

Tracking the current position.

Call the method Point by passing the parameter.

Call the method “initializeTracker()”.

Definition of “getPosition()”.

Return the center value

Main.py:

Import the require packages.

Definition of method “main()”.

Create an interface.

Call the method “Tracker()”.

Create the button “X”.

Activate the button.

Call the “Point()” by passing the arguments

Check the condition whether the “target” is clicked.

Call the update method.

Get the “x” and “y” position.

Move the ball.

Print the current position.

Check whether “dy” is less than 0.

Print the angle, velocity, initial height.

Call the main method.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

(Dynamic Programming.) Recall the problem presented in Assign- ment 3 where given a list L of n ordered integers you're tasked with removing m of them such that the distance between the closest two remaining integers is maxi- mized. See Assignment 1 for further clarification and examples. As it turns out there is no (known) greedy algorithm to solve this problem. However, there is a dynamic programming solution. Devise a dynamic programming solution which determines the maximum distance between the closest two points after removing m numbers. Note, it doesn't need to return the resulting list itself. Hint 1: Your sub-problems should be of the form S(i, j), where S(i, j) returns the maximum distance of the closest two numbers when only considering removing j of the first i numbers in L. As an example if L [3, 4, 6, 8, 9, 12, 13, 15], then S(4, 1) = 2, since the closest two values of L' = [3,4,6,8] are 6 and 8 after removing 4 (note, 8-6 = = 2). = Hint 2: For the sub-problem S(i, j),…

(Dynamic Programming.) A group of friends is visiting a number of attractions located along a highway, starting at kilometre 0, placed at distances ɑ1 < A2 < ···

(Greedy Algorithms) Describe an efficient algorithm that, given a set {x1, x2, . . ., xn} of points on the real line, determines the smallest set of unit-length closed intervals that contains all of the given points. Argue that your algorithm is correct.