Reference no: EM132586388

Assignment: You should create one Java file for each problem and save them all in one folder. Compress the folder as a .zip file and submit it here. Please name your .zip file as P5-Last Name-First Nam.zip. For example, P5-Smith-John.zip.

A Word document containing the algorithms and the screenshots of the running programs for all of the five problems. Please name your Word document as P5-Last Name-First Name.docx or .doc. For example, P5-Smith-John.docx.
Consider the following problems, design the algorithms that would solve them, and then implement the algorithm in Java.

Problem 1: Write a program that reads a set of floating-point values. Ask the user to enter the values, then print:

The average of the values
The smallest of the values
The largest of the values
The range, that is the difference between the smallest and the largest
Of course, you may only prompt for the values once.

Problem 2: Write a program that reads a word and prints each character of the word on a separate line. For example, if the user provides the input "Harry", the program prints:

H
a
r
r
y

Problem 3: The Fibonacci numbers are defined by the sequence:

f1 = 1
f2 = 1
fn = fn-1 + fn-2.

Reformulate that as

Fold1 = 1;
Fold2=1;
Fnew=fold1+fold2;

After that, discard fold2, which is no longer needed, and set fold2 to fold1, and fold1 to fnew. Repeat an appropriate number of times.

Implement a program that prompts the user for an integer n and prints the nth Fibonacci number, using the above algorithm.

Problem 4: Write a program that prints a multiplication table, like this:
1 2 3 4 5 6 7 8 9 10
2 4 6 8 10 12 14 16 18 20
3 6 9 12 15 18 21 24 27 30
...
10 20 30 40 50 60 70 80 90 100

Problem 5: This problem is the Problem 4 in Module 2 for the algorithm project. Now you already have the algorithm and you can copy it here. You still need to write the source code and take a screenshot of the running program.

Imagine yourself in the middle of Manhattan, where the streets are perpendicular on avenues. You are in a grid of streets, somewhat lost, and you randomly pick one of four directions and walk to the next intersection. Not knowing where you really want to go, you again randomly pick one of the four directions, and so on. After repeating the same movement for a number of times, you may want to know how far you got from the original point.

Represent locations as integer pairs(x,y). Create an algorithm that implements your movement through New York City, over 100 intersections, starting at (0,0) and print the ending location, taking into consideration that each movement, from one intersection to another will be one mile.