A method “removeLast()” Program plan: In a file “ArrayList.java”, create a class “ArrayList”, Declare the object variable. Declare the necessary variable. Define the constructor to create an empty array list. Define the method “removeLast()”, Check if the current size is less than “1”, If it is true, throws an exception. Assign the value. Decrement the size. Call the method “shrinkIfNecessary()”. Return the object. Define the method “shrinkIfNecessary()’, Compute the ratio. Check if the ratio is less than “0.25”, Create the array. Create a loop, Assign the element of the buffer to the new buffer. Assign the new buffer to the old buffer. Define the method “size()” to return the array list size. Define the method “checkBounds()” that throws an exception if the index that has been checked is out of bounds. Define the method “get()” that returns an element at a given position. Define the method “set()” that locates the element at a given position. Define the method “remove()” that removes an element at a given location. Call the method “checkBounds()”. Assign the element. Create a loop, Assign the current element to the previous location. Decrement the size. Return the element. Define the method “add()” to insert the element next to the given position. Define the method “addLast()” that insert the element next to the end of the array list. Define the method “growBufferIfNecessary()” that grow the buffer the buffer if the current size is same as the capacity of the buffer. In a file “ListTest.java”, create a class “ListTest”, Define the “main()” method. Create an “ArrayList” object. Call the method “addLast()” to add the element “David”. Call the method “addLast()” to add the element “Harris”. Call the method “addLast()” to add the element “Roman”. Call the method “addLast()” to add the element “Tommy”. Call the method “removeLast()”. Call the method “removeLast()”. Create a loop, Print the actual output. Print new line. Print the expected output.

Question

Want to see the full answer?

Answer 1

Question

Chapter 16, Problem 10PE

Program Plan Intro

A method “removeLast()”

Program plan:

In a file “ArrayList.java”, create a class “ArrayList”,

Declare the object variable.

Declare the necessary variable.

Define the constructor to create an empty array list.

Define the method “removeLast()”,

Check if the current size is less than “1”,

If it is true, throws an exception.

Assign the value.

Decrement the size.

Call the method “shrinkIfNecessary()”.

Return the object.

Define the method “shrinkIfNecessary()’,

Compute the ratio.

Check if the ratio is less than “0.25”,

Create the array.

Create a loop,

Assign the element of the buffer to the new buffer.

Assign the new buffer to the old buffer.

Define the method “size()” to return the array list size.

Define the method “checkBounds()” that throws an exception if the index that has been checked is out of bounds.

Define the method “get()” that returns an element at a given position.

Define the method “set()” that locates the element at a given position.

Define the method “remove()” that removes an element at a given location.

Call the method “checkBounds()”.

Assign the element.

Create a loop,

Assign the current element to the previous location.

Decrement the size.

Return the element.

Define the method “add()” to insert the element next to the given position.

Define the method “addLast()” that insert the element next to the end of the array list.

Define the method “growBufferIfNecessary()” that grow the buffer the buffer if the current size is same as the capacity of the buffer.

In a file “ListTest.java”, create a class “ListTest”,

Define the “main()” method.

Create an “ArrayList” object.

Call the method “addLast()” to add the element “David”.

Call the method “addLast()” to add the element “Harris”.

Call the method “addLast()” to add the element “Roman”.

Call the method “addLast()” to add the element “Tommy”.

Call the method “removeLast()”.

Call the method “removeLast()”.

Create a loop,

Print the actual output.

Print new line.

Print the expected output.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

3. Problem Description: Define the Circle2D class that contains: Two double data fields named x and y that specify the center of the circle with get methods. • A data field radius with a get method. • A no-arg constructor that creates a default circle with (0, 0) for (x, y) and 1 for radius. • A constructor that creates a circle with the specified x, y, and radius. • A method getArea() that returns the area of the circle. • A method getPerimeter() that returns the perimeter of the circle. • • • A method contains(double x, double y) that returns true if the specified point (x, y) is inside this circle. See Figure (a). A method contains(Circle2D circle) that returns true if the specified circle is inside this circle. See Figure (b). A method overlaps (Circle2D circle) that returns true if the specified circle overlaps with this circle. See the figure below. р O со (a) (b) (c)< Figure (a) A point is inside the circle. (b) A circle is inside another circle. (c) A circle overlaps another…

1. Explain in detail with examples each of the following fundamental security design principles: economy of mechanism, fail-safe default, complete mediation, open design, separation of privilege, least privilege, least common mechanism, psychological acceptability, isolation, encapsulation, modularity, layering, and least astonishment.

Security in general means the protection of an asset. In the context of computer and network security, explore and explain what assets must be protected within an online university. What the threats are to the security of these assets, and what countermeasures are available to mitigate and protect the organization from such threats. For each of the assets you identify, assign an impact level (low, moderate, or high) for the loss of confidentiality, availability, and integrity. Justify your answers.