P7.

1)
public class CurrencyConverter
{
public CurrencyConverter (double exchangeRate)
{
conversionRate = exchangeRate / 100;
}
public double convert (double usDollars)
{
euros = usDollars * conversionRate;
euros = Math.round (euros * 100);
euros = (double) (euros / 100);
return euros;
}
//instance fields
private double conversionRate;
private double euros;
private double usDollars;
}
-----------------------------------------------------------------------------------import java.util.Scanner;
public class CurrencyConverterTester
{
public static void main (String [] args)
{
Scanner mouse = new Scanner (System.in);
System.out.print ("Current Exchange Rate (%): ");
double conversionRate = mouse.nextDouble ();
CurrencyConverter xchange = new CurrencyConverter (conversionRat
e);
int x = 1;
double amount;
String quit;
while (x > 0)
{
System.out.print ("Currency to be exchanged: $");
amount = mouse.nextDouble ();
System.out.println (xchange.convert (amount) + " Euros")
;
System.out.print ("Please hit any key to continue or "Q"
to quit: ");
quit = mouse.next ();
if (quit.equalsIgnoreCase ("Q"))
break;
}
}
}
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------P7.5)
public class FibonacciGenerator
{
public FibonacciGenerator (int n)
{
nthTerm = n;

fold1 = 1;
fold2 = 1;
}
public void nextNumber ()
{
foldNew = fold1 + fold2;
fold2 = fold1;
fold1 = foldNew;
}
public int runFibonacci ()
{
for (int count = 1; count <= nthTerm; count++)
this.nextNumber ();
return foldNew;
}
//instance fields
private int nthTerm;
private int fold1;
private int fold2;
private int foldNew;
}
-----------------------------------------------------------------------------------import java.util.Scanner;
public class FibonacciGeneratorTester
{
public static void main (String [] args)
{
Scanner in = new Scanner (System.in);
System.out.print ("What term in Fibonacci sequence would you lik
e to find? \n n = ");
int n = in.nextInt ();
FibonacciGenerator sequence = new FibonacciGenerator (n);
System.out.println (sequence.runFibonacci ());
}
}
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------P7.10)
public class FactorGenerator2
{
public FactorGenerator2 (int number)
{
this.number = number;
prime = number - 1;
}
public void nextFactor ()
{
while (prime > 0)
{
primeTester = prime;
test = 0;
tester:

while (primeTester > 2)

{
primeTester--;
test = prime % primeTester;
if (test == 0)
break tester;
}
while (test != 0 && number % prime == 0)
{
System.out.println (prime);
number = number / prime;
}
if (number % prime == 0 && prime == 2)
System.out.println (prime);
prime--;
}
}
public void hasMoreFactors ()
{
while (number != 1)
this.nextFactor ();
}
//instance fields
private int number;
private int prime;
private int primeTester;
private int test;
}
-----------------------------------------------------------------------------------import java.util.Scanner;
public class FactorGeneratorTester
{
public static void main (String [] args)
{
Scanner mouse = new (System.in);
System.out.print ("Input a number to be broken down into its fac
tors: ");
int number = mouse.nextInt ();
FactorGenerator2 number1 = new FactorGenerator2 (number);
System.out.println ("Factors:\n--------");
number1.hasMoreFactors ();
}
}
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------P7.11)
public class PrimeGenerator
{
public PrimeGenerator (int number)
{
this.number = number;
}
public void nextPrime ()
{

while (number > 0)

{
primeTester = number;
test = 0;
tester:
while (primeTester > 2)
{
primeTester--;
test = number % primeTester;
if (test == 0)
break tester;
}
if (test != 0)
System.out.println (number);
number--;
}
}
//instance fields
private int number;
private int primeTester;
private int test;
}
-----------------------------------------------------------------------------------import java.util.Scanner;
public class PrimeGeneratorTester
{
public static void main (String [] args)
{
Scanner mouse = new Scanner (System.in);
System.out.print ("Input a number to find the prime numbers lowe
r than your number: ");
int number = mouse.nextInt ();
PrimeGenerator number1 = new PrimeGenerator (number);
number1.nextPrime ();
}
}
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------P7.15)
import java.util.Random;
public class DataSet
{
public DataSet ()
{
total = 0;
average = 0;
max = 0;
}
public void getNumbers ()
{
Random x = new Random ();
for (int count = 1; count <= 100; count++)
{
int y = x.nextInt(1001);

if (y > max)
max = y;
total += y;
if (count == 100)
average = total / count;
}
}
public double getAverage ()
{
return average;
}
public int getMax ()
{
return max;
}
//instance fields
private int total;
private double average;
private int max;
}
-----------------------------------------------------------------------------------public class DataSetTester
{
public static void main (String [] args)
{
DataSet x = new DataSet ();
x.getNumbers();
System.out.println ("Average: " + x.getAverage());
System.out.println ("Max: " + x.getMax());
}
}