professor sent this: Create an AccountManager class according to the specificati

Question

professor sent this:
Create an AccountManager class according to the specification. HINT: The class should use an array to keep track of Account objects.

closeAccount

public void closeAccount(int id)

Method to close an Account The effect of this method is to make the specified Account no longer accessible

Parameters:
id - number of the Account to close
Throws:
IllegalArgumentException - if the id number is negative or there is no Account for that id or the account is already closed

getAccount

public Account getAccount(int id)

Method to get the Account object for the specified id number

Parameters:
id - number of the desired Account
Returns:
the Account object for this id
Throws:
IllegalArgumentException - if id does not specify a valid Account (i.e. id is negative or there is no Account for that id or the account is not open)
IllegalArgumentException - if the specified Account is closed

openAccount

public int openAccount(String accountOwner,
double rate)

Method to open a new Account. It creates the Account and allocates an id number for it

Parameters:
accountOwner - name of the Account owner
rate - Annual interest rate for this new Account
Returns:
the id number for the new Account
Throws:
IllegalArgumentException - if the array is already filled

Explanation / Answer

import java.util.Arrays; import java.util.Random;  import org.junit.Before; import org.junit.Test;  import static org.junit.Assert.assertTrue; import static org.junit.Assert.fail;  public class QuicksortTest {  private int[] numbers; private final static int SIZE = 7; private final static int MAX = 20;  @Before public void setUp() throws Exception { numbers = new int[SIZE]; Random generator = new Random(); for (int i = 0; i < numbers.length; i++) { numbers[i] = generator.nextInt(MAX); } }  @Test public void testNull() { Quicksort sorter = new Quicksort(); sorter.sort(null); }  @Test public void testEmpty() { Quicksort sorter = new Quicksort(); sorter.sort(new int[0]); }  @Test public void testSimpleElement() { Quicksort sorter = new Quicksort(); int[] test = new int[1]; test[0] = 5; sorter.sort(test); }  @Test public void testSpecial() { Quicksort sorter = new Quicksort(); int[] test = { 5, 5, 6, 6, 4, 4, 5, 5, 4, 4, 6, 6, 5, 5 }; sorter.sort(test); if (!validate(test)) { fail("Should not happen"); } printResult(test); }  @Test public void testQuickSort() { for (Integer i : numbers) { System.out.println(i + " "); } long startTime = System.currentTimeMillis();  Quicksort sorter = new Quicksort(); sorter.sort(numbers);  long stopTime = System.currentTimeMillis(); long elapsedTime = stopTime - startTime; System.out.println("Quicksort " + elapsedTime);  if (!validate(numbers)) { fail("Should not happen"); } assertTrue(true); }  @Test public void testStandardSort() { long startTime = System.currentTimeMillis(); Arrays.sort(numbers); long stopTime = System.currentTimeMillis(); long elapsedTime = stopTime - startTime; System.out.println("Standard Java sort " + elapsedTime); if (!validate(numbers)) { fail("Should not happen"); } assertTrue(true); }  private boolean validate(int[] numbers) { for (int i = 0; i < numbers.length - 1; i++) { if (numbers[i] > numbers[i + 1]) { return false; } } return true; }  private void printResult(int[] numbers) { for (int i = 0; i < numbers.length; i++) { System.out.print(numbers[i]); } System.out.println(); } } 
 

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.