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

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…

how to read log logs

Discrete Mathematics for Computer Engineering