Question

In this question you are going to produce a simplified collection type called MyMiniList.

MyMiniList will work in a similar way to ArrayList. Internally, it will use an array, you will have to reorganise and grow the array as the MiniList is updated through use of its methods. Inside the template is an interface called MiniList.
MyMiniList must implement this interface and be implemented with a single generic type.
Also included in the template is a simple set of tests for you to verify your implementation against.
You will receive the following marks for correctly implementing each of the interfaces methods and a constructor.
Your class will need two instance variables, 1 for the current size of the list (an int) and an array of generic type T to store the elements of the list call this objectStore.
i) public MyMiniList() [2 marks] Initialise the array of elements, this is a little tricky as Java Generics doesn’t support arrays. There are a couple of approaches you can use. This is the easiest and is moderately type safe, however, IntelliJ will give you some warnings: objectStore = (T[]) new Object[10]; Initially, set the size of this array to be 10. Also set your size variable to be 0.
ii) public void add(T element) [3 marks] Elements are added to the end of the objectStore array if the array has space. If the array doesn’t have space you will need to create a new array twice the size now required, copy in the existing elements and replace the existing objectStore with this new array. System.arrayCopy is useful to achieve this but there are other methods you could use. You can then add in the new element and update the size variable.
iii) public T get(int index) [2 marks] Check that the index given is with the required bounds. You can use the built in method Objects.checkIndex to do this (no imports required). If the index is valid return the item at the index
iv) public int getIndex(T element) [2 marks] Search through the list for the first occurrence of the element given as an argument. If found return its index. Otherwise return -1.
v) public void set(int index, T element); [2 marks] Check if the index is valid. If so set the value at the index to be the element given in the second parameter. public int size(); [1 mark] Return the size of the list. (Make sure you return the size of list not the size of the underlying array)
vi) public T remove(int index); [4 marks] Check if a valid index has been given. If so remove the element and return it. You will need to move down the end of the array after the removal point so there is no gap and adjust your size property accordingly.
vii) public boolean remove(T element); [4 marks] Search the list for the first instance of the element and remove it. Again you will need to shift the array down to fill the gap left. TIP: you might be able to use the previous method to help you.
viii) public void clear(); [1 mark] Empty the list and reset the size to 0.

Answer 1

My Min iList is a simplified collection type similar to Array List. It uses an array to store elements and dynamically grows the array as the list is updated. The class needs to implement the Mini List interface with a single generic type.

Step-by-step explanation:

My Mini List is a simplified collection type similar to Array List. It internally uses an array to store elements and dynamically grows the array as the list is updated through its methods. The class needs to implement the Mini List interface with a single generic type. The My Mini List class should have two instance variables - one for the current size of the list and an array called 'object Store' to store the elements.

The size of the initial array should be set to 10. The class should implement the following methods: public My Mini List(): Initializes the object Store array and sets the size variable to 0. public void add(T element): Adds an element to the end of the object Store array. If the array is full, a new array twice the size is created, the existing elements are copied, and the new element is added. public T get(int index): Returns the element at the given index if it is within the bounds of the list.

public int getIndex(T element): Searches for the first occurrence of the given element in the list and returns its index. Returns -1 if the element is not found. public void set(int index, T element): Sets the value at the given index to the provided element. public int size(): Returns the current size of the list. public T remove(int index): Removes and returns the element at the given index. The remaining elements are shifted to fill the gap.