I am making a digital clock and I am trying to write a findAmVsPM method that determins if a clock currently has a morning time or an afternoon/evening time. I need this method to implement the following specifications: /** * Returns "AM" or "PM" depending on the clock time. * * @precondition clock != null * @postcondition none * * @param clock the clock * @return "AM" if the time is in the morning (between midnight and 11:59), "PM" otherwise I am currently trying to complete the body of this method however, I am getting caught on two specific steps. I need to figure out how to enforce the precondition and write code that returns "AM" if the clock's time is currently before 12 hours other wise it returns "PM". Is there anyway I could get assitance on this?

I am making a digital clock and I am trying to write a findAmVsPM method that determins if a clock currently has a morning time or an afternoon/evening time. I need this method to implement the following specifications: /** * Returns "AM" or "PM" depending on the clock time. * * @precondition clock != null * @postcondition none * * @param clock the clock * @return "AM" if the time is in the morning (between midnight and 11:59), "PM" otherwise I am currently trying to complete the body of this method however, I am getting caught on two specific steps. I need to figure out how to enforce the precondition and write code that returns "AM" if the clock's time is currently before 12 hours other wise it returns "PM". Is there anyway I could get assitance on this?

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter3: Using Methods, Classes, And Objects

Section: Chapter Questions

Problem 2PE

See similar textbooks

Similar questions

"A complex number is defined as z=a+i*b, where a is the real part, and b is the imaginary part. In other words, in order to define a complex number, we need the two floating numbers a and b. Write methods that perform for each of the following operations with complex numbers z1 = a1 + i*b1, and z2 = a2 + i*b2:" is my problem. i get input for a and b in order to find z but what is a2 and b2? are they the same??
For this problem you will write a method that prints out a pyramid. The boxes in each layer of the pyramid are stacked directly on top of one another (i.e. not offset between two boxes below). For example, below are shown two pyramids, one with base 5 and one with base 6. [] [][] [][][] [][][][] [][][][][] [][][][][][]
WRITE A JAVA PROGRAM Methods can be used to define reusable code and organize and simplify code. Problem:- Suppose that you need to find the sum of integers from 5 to 15, from 16 to 30, and from 31 to 39, respectively. Define a public static sum method that take two int parameters -> (int start, int end) In the method, use for loop to add all the number from start to end. Later, invoke the sum inside the main method. Do the sum for each a) 5 to 15; b) 16 to 30; and c) 31 to 39 separately and later print the results. Output: Sum from 5 to 15 is 110 Sum from 16 to 30 is 345 Sum from 31 to 39 is 315
For this problem you will write a method that computes the number of boxes in a pyramid of boxes based on the number of boxes in the base. The boxes in each layer of the pyramid are stacked directly on top of one another (i.e. not offset between two boxes below). For example, below are shown two pyramids, one with base 5 and one with base 6. [] [][] [][][] [][][][] [][][][][] [][][][][][] Implement and test the computePyramidBoxes() method in the PyramidBoxCount class. When testing the computePyramidBoxes() method you should be sure to have at least one test method for each base case and at least one test method for each recursive case in your program.
Consider the below method which computes the value x. Specifically, x = (a*b)/c, based on inputs a, b, and c. This function have several problems. public int computeX (int a, int b, int c){ int x = (a*b)/c; Rewrite the method to fix these errors. return x;}
You have a card on which the letter J is written on one side and K on the other. You want to seeall of the possible ways the card will land if you drop it n times. Write a recursive method thatprints each session of dropping the cards with J's and K's. For example if you drop it 4 times in agiven session, all possible ways to drop it are as follows (in exactly the specified order): (java code)
A method is implemented to compute a formula that involves dividing a quantity by a variable y. If y is 0, then an ArithmeticException will be thrown. How should you handle this situation? Here are some alternatives: 1. Ignore the problem and let your method throw an ArithmeticException. 2.Test for y==0 before doing the computation and, if found, print an error message and return 0. 3.Surround the computation with a try/catch block and print an error message in the catch block before returning 0. a. Compare these three alternatives. That means talk about how each is the same as or different than the other two. b. Is there a fourth alternative that is better than these three? If there is, give it along with a justification. If there is not, explain why not.
Write a Java program that implements static method roundSum() so that given 3 ints: a, b, and c; return the sum of their rounded values. We'll round an int value up to the next multiple of 10 if its rightmost digit is 5 or more, so 15 rounds up to 20. Alternately, round down to the previous multiple of 10 if its rightmost digit is less than 5, so 12 rounds down to 10. roundSum(16, 17, 18) → 50roundSum(12, 13, 14) → 40roundSum(6, 4, 4) → 10 The examples of input and output you can see in the picture. (the code structure should be as in the second picture)
vvvHarry has a big wall clock, that got hit while he was playing. Now, the minute hand doesn't rotate by the angle 2π/3600 each second, but now it moves according to different angle x. You can assume that coordinates of the centre of the clock are (0, 0) and the length of the minute hand is l. One endpoint of the minute hand is always located at the clock centre; the other endpoint is initially located at the point (0, l). One second later, Harry observes that this endpoint is at distance d above the x-axis, i.e., the y-coordinate of this endpoint is equal to d. Harry is curious about where the minute hand will be (specifically, its y-coordinate) after t seconds. Because t can be very large, Harry can't wait for that moment. Please help him to write a python code that prints a single line containing the output.Input: 4 2 2Output4Harry has a big wall clock, that got hit while he was playing. Now, the minute hand doesn't rotate by the angle 2π/3600 each second, but now it moves according…
Assume that we want to swap the values of two integer -variables, a andb. To do this, we write a method public void swap(int i1, int i2){int tmp = i1; i1 = i2; i2 = tmp;}Then we call this method with our a and b variables:swap(a, b);Are a and b swapped after this call? If you test it, you will notice that they are not! Why does this not work? Explain in detail.
You have a card on which the letter J is written on one side and K on the other. You want to seeall of the possible ways the card will land if you drop it n times. Write a recursive method thatprints each session of dropping the cards with J's and K's. For example if you drop it 4 times in agiven session, all possible ways to drop it are as follows (in exactly the specified order): J J J JJ J J KJ J K JJ J K KJ K J JJ K J KJ K K JJ K K KK J J JK J J KK J K JK J K KK K J JK K J KK K K JK K K K
Define a method findEmployeeTax() that takes two integer parameters as a person's salary and the number of dependents, and returns the person's tax percent as a double. The tax percent is returned as follows: Salary ≤ 1 dependent 2 - 5 dependents ≥ 6 dependents < 450000 0.15 0.05 0 450000 - 824999 0.25 0.15 0.15 ≥ 825000 0.4 0.25 0.25 Ex: If the input is 425000 0, then the output is: 0.15 import java.util.Scanner; public class TaxFinder { public static double findEmployeeTax(int salary, int numDepen) { double i; if (salary < 450000) { if(numDepen <= 1) i = 0.15; else if (numDepen >= 2 && numDepen <= 5) i = 0.05; else if (numDepen >= 6) i = 0; } else if (salary >= 450000 && salary <= 824999) { if(numDepen <= 1) i = 0.25; else if (numDepen >= 2 && numDepen <= 5) i = 0.15; else if (numDepen >= 6) i = 0.15; } else if…