
Java: An Introduction to Problem Solving and Programming (8th Edition)
8th Edition
ISBN: 9780134462035
Author: Walter Savitch
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 5, Problem 12PP
Program Plan Intro
Monkey face and hand in JavaFX Application
Program Plan:
- • Import required package.
- • Define “enum” class for monkey hand position.
- • Define “drawMonkeyFace” class.
- ○ Initializes required variables.
- ○ Define main function.
- ○ Define “drawFace” method with argument of “GraphicsContext” object, “at_XBase”, “at_YBase” and “HandPosition” object.
- ■ Invoke “strokeOval” method for object “gContext”.
- ■ Compute the monkey ear width, height and offset to draw the monkey ear.
- ■ Invoke “strokeOval” method for object “gContext”.
- ■ Compute the monkey eye width, height and offset to draw the monkey eye.
- ■ Invoke “strokeOval” method for object “gContext”.
- ■ Compute the monkey mouth width, height and offset to draw the monkey mouth.
- ■ Invoke “strokeArc” for object “gContext” which is used to draw arc.
- ■ Declare required variables for hand offset.
- ■ Check location of hand using “switch” case.
- • If the case is “MONKEY_MOUTH”, then compute hand offset for “X” and “Y” and then call “drawMonkeyHand” method.
- • If the case is “MONKEY_EYE”, then compute hand offset for “X” and “Y” and then call “drawMonkeyHand” method.
- • If the case is “MONKEY_EAR”, then compute hand offset for “X” and “Y” and then call “drawMonkeyHand” method.
- ○ Define “drawMonkeyHand” method with argument of “GraphicsContext” object, “at_XBase” and “at_YBase”.
- ■ Compute palm width and height.
- ■ Invoke “fillOval” method for object “gContext”.
- ■ Compute finger width, height of monkey and offset.
- ■ Invoke “fillOval” method for object “gContext”.
- ○ Define “start” method.
- ■ Create an object “rt” from “Group” class.
- ■ Create an object “s” from “Scene” class.
- ■ Create an object “ca” from “Canvas” class.
- ■ Create object for “GraphicsContext” class.
- ■ Draw monkey ear by calling method “drawFace”.
- ■ Set the font by using the method “setFont”.
- ■ Set text for first monkey face by using method “fillText”.
- ■ Draw monkey eye by calling method “drawFace”.
- ■ Set text for second monkey face by using method “fillText”.
- ■ Draw monkey mouth by calling method “drawFace”.
- ■ Set text for third monkey face by using method “fillText”.
- ■ Set title for given program.
- ■ Call “setScene” method for stage.
- ■ Display the all pics by using method “show”.
Expert Solution & Answer

Trending nowThis is a popular solution!

Students have asked these similar questions
Suppose that the two Rank methods below are added to the Skip List class on Blackboard.
public int Rank(T item)
Returns the rank of the given item.
public T Rank(int i)
Returns the item with the given rank i.
Requirements
1. Describe in a separate Design Document what additional data is needed and how that data is used to
support an expected time complexity of O(log n) for each of the Rank methods. Show as well that the
methods Insert and Remove can efficiently maintain this data as items are inserted and removed. (7
marks)
2. Re-implement the methods Insert and Remove of the Skip List class to maintain the augmented data in
expected O(log n) time. Using the Contains method, ensure that added items are distinct. (6 marks)
3. Implement the two Rank methods. (8 marks)
4. Test your new methods thoroughly. Include your test cases and results in a Test Document. (4 marks)
https://docs.google.com/document/d/1lk0DgaWfVezagyjAEskyPoe9Ciw3J2XUH_HQfnWSmwU/edit?usp=sharing
use the link to answer the question below
b) As part of your listed data elements, define the following metadata for each: Data/FieldType, Field Size, and any possible constraint/s or needed
c) Identify and describe the relationship/s among the tables. Please provide an example toillustrate Referential Integrity and explain why it is essential for data credibility.
I have inserted the data elements below for reference
Highlight the main differences between Computer Assisted Coding and Alone Coding with their similarities
Chapter 5 Solutions
Java: An Introduction to Problem Solving and Programming (8th Edition)
Ch. 5.1 - Consider the program in Listing 5.4 . Suppose you...Ch. 5.1 - Prob. 2STQCh. 5.1 - Prob. 3STQCh. 5.1 - Suppose every species in the world has a peculiar...Ch. 5.1 - Revise the definition of the method writeOutput in...Ch. 5.1 - Revise the definition of the method readInput in...Ch. 5.1 - Revise the definition of the method...Ch. 5.1 - What is the meaning of (int) that appears in the...Ch. 5.1 - Prob. 9STQCh. 5.1 - Define a method called getDensity that could be...
Ch. 5.1 - Define a method called changePopulation that could...Ch. 5.1 - Define a method called changePopulation that could...Ch. 5.2 - In Listing 5.12, we set the data for the object...Ch. 5.2 - Give preconditions and postconditions for the...Ch. 5.2 - What is an accessor method? What is a mutator...Ch. 5.2 - Give the complete definition of a class called...Ch. 5.2 - Prob. 17STQCh. 5.2 - In the definition of the method in Listing 5.15,...Ch. 5.2 - What is a well-encapsulated class definition?Ch. 5.2 - When should an instance variable in a class...Ch. 5.2 - Prob. 21STQCh. 5.2 - In a class definition, is anything private ever...Ch. 5.2 - In a class definition, is the body of any method...Ch. 5.3 - What is a reference type? Are class types...Ch. 5.3 - When comparing two quantities of a class type to...Ch. 5.3 - Prob. 26STQCh. 5.3 - Write a method definition for a method called...Ch. 5.3 - Given the class Species as defined in Listing...Ch. 5.3 - After correcting the program in the previous...Ch. 5.3 - What is the biggest difference between a parameter...Ch. 5.3 - Prob. 31STQCh. 5.3 - Write an equals method for the class Person...Ch. 5.4 - Rewrite the method drawFaceSansMouth in Listing...Ch. 5 - Design a class to represent a credit card. Think...Ch. 5 - Repeat Exercise 1 for a credit card account...Ch. 5 - Repeat Exercise 1 for a coin instead of a credit...Ch. 5 - Repeat Exercise 1 for a collection of coins...Ch. 5 - Consider a Java class that you could use to get an...Ch. 5 - Consider a class that keeps track of the sales of...Ch. 5 - Consider a class MotorBoat that represents...Ch. 5 - Prob. 8ECh. 5 - Prob. 9ECh. 5 - Prob. 10ECh. 5 - Write a program to answer questions like the...Ch. 5 - Define a class called Counter. An object of this...Ch. 5 - Prob. 3PCh. 5 - Define a Trivia class that contains information...Ch. 5 - Define a Beer class that contains the following...Ch. 5 - Write a grading program for an instructor whose...Ch. 5 - Add methods to the Person class from Self-Test...Ch. 5 - Create a class that represents a grade...Ch. 5 - Write a program that uses the Purchase class in...Ch. 5 - Write a program to answer questions like the...Ch. 5 - Consider a class that could be used to play a game...Ch. 5 - Consider a class BasketballGame that represents...Ch. 5 - Consider a class ConcertPromoter that records the...Ch. 5 - Prob. 9PPCh. 5 - Consider a class Movie that contains information...Ch. 5 - Repeat Programming Project 18 from Chapter 4, but...Ch. 5 - Prob. 12PP
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Suppose that the MinGap method below is added to the Treap class on Blackboard. public int MinGap ( ) Returns the absolute difference between the two closest numbers in the treap. For example, if the numbers are {2, 5, 7, 11, 12, 15, 20} then MinGap would returns 1, the absolute difference between 11 and 12. Requirements 1. Describe in a separate Design Document what additional data is needed and how that data is used to support an time complexity of O(1) for the MinGap method. Show as well that the methods Add and Remove can efficiently maintain this data as items are added and removed. (6 marks) 2. Re-implement the methods Add and Remove of the Treap class to maintain the augmented data in expected O(log n) time. (6 marks) 3. Implement the MinGap method. (4 marks) 4. Test your new method thoroughly. Include your test cases and results in a Test Document. (4 marks)arrow_forwardSuppose that the two Rank methods below are added to the Skip List class on Blackboard. public int Rank (T item) Returns the rank of the given item. public T Rank(int i) Returns the item with the given rank i. Requirements 1. Describe in a separate Design Document what additional data is needed and how that data is used to support an expected time complexity of O(log n) for each of the Rank methods. Show as well that the methods Insert and Remove can efficiently maintain this data as items are inserted and removed. (7 marks) 2. Re-implement the methods Insert and Remove of the Skip List class to maintain the augmented data in expected O(log n) time. Using the Contains method, ensure that added items are distinct. (6 marks) 3. Implement the two Rank methods. (8 marks) 4. Test your new methods thoroughly. Include your test cases and results in a Test Document. (4 marks)arrow_forwardSuppose that the two Rank methods below are added to the Skip List class on Blackboard. public int Rank (T item) Returns the rank of the given item. public T Rank(int i) Returns the item with the given rank i. Requirements 1. Describe in a separate Design Document what additional data is needed and how that data is used to support an expected time complexity of O(log n) for each of the Rank methods. Show as well that the methods Insert and Remove can efficiently maintain this data as items are inserted and removed. (7 marks) 2. Re-implement the methods Insert and Remove of the Skip List class to maintain the augmented data in expected O(log n) time. Using the Contains method, ensure that added items are distinct. (6 marks) 3. Implement the two Rank methods. (8 marks) 4. Test your new methods thoroughly. Include your test cases and results in a Test Document. (4 marks)arrow_forward
- automata theoryarrow_forwardI need help in construct a matlab code to find the voltage, the currents, and the watts based on that circuit.arrow_forwardObjective Implement Bottom-Up Iterative MergeSort and analyze its efficiency compared to recursive MergeSort. Unlike the recursive approach, which involves multiple function calls and stack overhead, the bottom-up version sorts iteratively by merging small subarrays first, reducing recursion depth and improving performance. Task 1. Implement Bottom-Up Iterative MergeSort о Start with single-element subarrays and iteratively merge them into larger sorted sections. Use a loop-based merging process instead of recursion. ○ Implement an efficient in-place merging strategy if possible. 2. Performance Analysis Compare execution time with recursive MergeSort on random, nearly sorted, and reversed datasets. ○ Measure and plot time complexity vs. input size. O Submission Explain why the iterative version reduces function call overhead and when it performs better. • Code implementation with comments. • A short report (1-2 pages) comparing performance. • Graph of execution time vs. input size for…arrow_forward
- Given a shared data set, we allow multiple readers to read at the same time, and only one single writer can access the shared data at the same time. In the lecture slides, a solution is given. However, the problem is that the write cannot write forever, if there are always at least one reader. How to ensure that the writer can eventually write? Propose your solution by using semaphores and implemented in Python from threading import Thread, Semaphore from time import sleep from sys import stdout class Reader(Thread): def__init__(self, name): self.n=name; Thread.__init__(self) defrun(self): globalnr, nw, dr, dw whileTrue: # ⟨await nw == 0 then nr += 1⟩ e.acquire() ifnw>0: #if nw > 0 or dw > 0 : dr+=1; e.release(); r.acquire() nr+=1 ifdr>0: dr-=1; r.release() else: e.release() # read data stdout.write(self.n+' reading\n') sleep(1) # ⟨nr -= 1⟩ e.acquire() nr-=1 ifnr==0anddw>0: dw-=1 ; w.release() else: e.release() class Writer(Thread): def__init__(self, name):…arrow_forwardAnnée scolaire: 2024/2025 Collège SMARA Devoir à domicile 1 semestre 2 Prof: NILAJ PHYSIQUE CHIMIE Nom et Prénom: Niveau: 3APIC Exercice 1: Durée: 1 heure 1) Donner la définition des termes suivantes? Le Mouvement : La vitesse moyenne: 2) Répondre par « Vrai » ou «> Un objet peut être en mouvement et au repos Si la vitesse est constante, le mouvement sera uniforme. 3) Compléter les phrases par les termes qui conviennent : Pour déterminer le mouvement ou le repos d'un objet, vous devez choisir un autre objet appelé le d'un point d'un corps mobile est l'ensemble des positions qu'il occupe durant son mouvement. Il y a trois types de trajectoires: circulaire. La distance de freinage dépend de 4) Cocher la bonne réponse? > La relation entre la vitesse, la distance et le temps: d Vm = dxt > L'unité internationale de la vitesse moyenne est : m/s 5) On considère la figure suivante : Compléter le tableau par les mots suivants : En mouvement au repos A C Km/h et et l' m. s-1 15 A B C Sol…arrow_forward5. Here is a tree corresponding to T(64) for an unknown recurrence relation: 32 + lg 64 8+ lg 16 2+ lg 4 2+lg4 2+lg4 8+ lg 16 2+lg4 7 7 7 7 7 7 7 7 Fill in the details for the corresponding recurrence relation: T(n) = T(n/4)+ T(1)= Put scratch work below. Scratch work is not graded but may be used for regrade partial credit.arrow_forward
- Top screenshot is question, the rest are examples and explinations.arrow_forwardActivity Time (days) Predecessors Earliest Expected Completion Time (TE) Latest Expected Completion Time (TE) 1 4 2 5 1 3456782222 6 1 7 1 4 4 6 2,3 5 3 5 5,7 9 4 7 10 3 6,9 11 5 8,9,10 12 4 11 Slack Critical Path? Yes or Noarrow_forwardI would like to know about the following concepts: 1. defragmentation 2. disk management 3. hardware RAIDarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage LearningEBK JAVA PROGRAMMINGComputer ScienceISBN:9781305480537Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTEBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT
- Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:CengageMicrosoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,

Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning

EBK JAVA PROGRAMMING
Computer Science
ISBN:9781305480537
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT

EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage

Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,