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

Good mrng, please solve this trying to follow this criteria. (use Keil) Abstract describing the requirements and goals of the assignment. List file with no errors or warnings. Brief description of your implementation design and code. Debugging screen shots for different scenarios with your reference and comments. Conclusion (and please give me the code without errors, make sure it is working)

#include <stdio.h> #include <stdlib.h> #include <unistd.h> int global_var = 42; // int* function(int *a) { int local_var = 10; // *a = *a + local_var; int *local_pointer = (int *)malloc (size of (int) * 64); // Allocated array with 64 integers return local_pinter; } int main() { int local_main[1024*1024*1024*1024*1024] = {0}; // initialize an array and set all items as 0 int *heap_var = (int *)malloc(size of(int) * 16); // Allocated array with 16 integers *heap_var = 100; function(heap_var); printf(“the value is %d\n”, *heap_var); free(heap_var); // release the memory return 0; } 1) draw the memory layout of the created process, which should include text, data, heap and stack [2 marks]. 2) Indicate which section the variables are allocated [2 marks]: global_var local_var, local_pointer local_main heap_var, *heap_var (the data that it points to) 3) Does this code have memory leaking (heap memory is not released)? [2 marks] 4) The…

8. List three HDD scheduling algorithms. [2 marks] 9. True or False? The NVM has the same scheduling algorithms with HDD. Explain why? [2 marks] 10. Why the modern mouses use polling to detect movements instead of interrupts? [2 marks] 11. What is thrashing? How does it happen? [2 marks] 12. Given a reference string of page numbers 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 and 4 frames show how the page replacement algorithms work, and how many page faults? [6 marks], 1) FIFO algorithm? [2 marks] 2) Optimal algorithm? [2 marks] 3) LRU algorithm? [2 marks] 13. List at least three file systems that you know. [2 marks] 14. In C programming, how the seek to a specific position in the file by offset? [2 marks]