Important!Before beginning any work, do a Team...Pull in your repository.
We strongly suggest that you proceed one method at a time through the work below, testing each time to be sure what you have written so far is correct.If you show up for help with a bunch of methods that don't work because you typed them all in before testing anything, we may not be able to help you until you clean up your code and focus on one method at a time.
sumDownBy2
with the following specification.
PARAMETERS: an integer n RETURN VALUE: the sum of the positive integers n + (n-2) + (n-4) + ... EXAMPLES: sumDownBy2(7) is 7+5+3+1 = 16 sumDownBy2(8) is 8+6+4+2 = 20 sumDownBy2(0) is 0 sumDownBy2(-1) is 0
At this point you should have run the JUnit test and determined whether your sumDownBy2 works properly. Don't push ahead until you pass that part of the JUnit test.Continue the lab in this fashion: write code, test the code, and then move forward.
harmonicSum
with the following specification.
PARAMETERS: a positive integer, n RETURN VALUE: the sum 1 + 1/2 + 1/3 + ... + 1/(n-1) + 1/n
Warning: Think carefully about this method's return type!
geometricSum
with the following specification.
PARAMETERS: a non-negative integer, k RETURN VALUE: the sum 1 + 1/2 + 1/4 + 1/8 + ... + 1/Math.pow(2,k)
multPos
that takes in two positive integers and returns their product.
PARAMETERS: positive integers j and k RETURN VALUE: the product j*k
You must accomplish this without using the multiplication operator. Use iteration and repeated addition to form the product.
mult
that takes in two integers and returns their product.
Each integer could be positive, negative, or zero.
PARAMETERS: integers j and k RETURN VALUE: the product j*k
Do this by calling your multPos method:
- Pass multPos the absolute values of j and k. It should return the product of those positive values.
- Compute this method's return value based on the result of multPos and based on the signs of j and k.
expt
with the following specification. Use repeated multiplication.
(Do not use the built-in exponentiation method.)
PARAMETERS: integers n and k, where k >= 0 RETURN VALUE: the value of n to the power k EXAMPLES: expt(3,2) is 9 expt(5,0) is 1 expt(2,5) is 32
Before you demo, go back to your methods and type in JavaDoc comments above each method declaration. Recall that eclipse helps you do this if you start out by typing /** above a method declaration.
When you are done with this lab, you must be cleared by the TA to receive credit.
- Do a Team…Pull to update your repository. You must do this or the commit/push below may fail.
- Commit and push all your work to your repository.
Make certain this has worked by logging into bitbucket. There you will see the commit(s) in your news feed if it was successful. You can also check the Source page to locate and ensure your code was received.It is your responsibility to make certain the code has been pushed. Some of your work receives credit through testing of your pushed code. You will receive no credit for such work if you failed to push. We generally reserve the right to revoke credit for any of your work that has not been pushed on-time.
- Fill in the form below with the relevant information
- Have a TA check your work
- The TA should check your work and then fill in the TA's name
- Click OK while the TA watches
- If you request propagation, it does not happen immediately, but should be posted in the next day or so
This demo box is for lab 5