Data structure & Algorithum java program1) Add a constructor to the class "AList" that creates a list from a given array of objects.2) Add a method "getPosition" to the "AList" class that returns the position of a given object in the list. The header of the method is as follows : public int getPosition(T anObject)3) Write a program that thoroughly tests all the methods in the class "AList".4) Include comments to all source code. Here's a transcription of the image:```javaimport chapter5.ListInterface.*;public class AList implements ListInterface { private T[] list; private int numberOfEntries; private boolean integrityOK = false; private static final int DEFAULT_CAPACITY = 25; private static final int MAX_CAPACITY = 1000; public AList() throws Exception { this(DEFAULT_CAPACITY); } public AList(int initialCapacity) throws Exception { integrityOK = false; // is capacity too small? if (initialCapacity < DEFAULT_CAPACITY) initialCapacity = DEFAULT_CAPACITY; else checkCapacity(initialCapacity); T[] tempList = (T[]) new Object[initialCapacity + 1]; list = tempList; numberOfEntries = 0; integrityOK = true; } private void checkCapacity(int capacity) throws Exception { if (capacity > MAX_CAPACITY) throw new Exception("Attempt to create a list whose capacity exceeds the max."); } @Override public void add(T newEntry) { add(numberOfEntries + 1, newEntry); } @Override public void add(int newPosition, T newEntry) { try { checkIntegrity(); if ((newPosition >= 1) && (newPosition <= numberOfEntries + 1)) { if (newPosition <= numberOfEntries + 1) { makeRoom(newPosition); list[newPosition] = newEntry; numberOfEntries++; ensureCapacity(); } } } catch (Exception e) { System.out.println(e.getMessage()); } } private void checkIntegrity() { // Implementation not shown } private void makeRoom(int newPosition) { // Implementation not shown } private void ensureCapacity() { // Implementation not shown }}```### OverviewThis code defines a Java class called `AList` that implements the `ListInterface` interface. The class is designed to manage a list that can dynamically grow as new elements are added. It includes key attributes and methods:1. **Attributes**: - `list`: An array to store the entries. - `numberOfEntries`: An integer tracking the number of entries in the list. - `integrityOK`: A boolean indicating whether The image shows a section of Java code, likely part of a class handling an array-based list structure. Below is a transcription and explanation of the code:```javaprivate void ensureCapacity() throws Exception { int capacity = list.length - 1; if (numberOfEntries >= capacity) { int newCapacity = 2 * capacity; checkCapacity(newCapacity); list = Arrays.copyOf(list, newCapacity + 1); }}private void makeRoom(int newPosition) { int newIndex = newPosition; int lastIndex = numberOfEntries; for (int index = lastIndex; index >= newIndex; index--) { list[index + 1] = list[index]; }}private void checkIntegrity() throws Exception { if (!integrityOK) throw new Exception("AList object is corrupt.");}@Overridepublic T remove(int givenPosition) { // TODO Auto-generated method stub return null;}@Overridepublic void clear() { // TODO Auto-generated method stub}@Overridepublic T replace(int givenPosition, T newEntry) { // TODO Auto-generated method stub return null;}@Overridepublic T getEntry(int givenPosition) { // TODO Auto-generated method stub return null;}@Overridepublic T[] toArray() { try { checkIntegrity(); T[] result = (T[]) new Object[numberOfEntries + 1]; for (int index = 0; index < numberOfEntries; index++) result[index] = list[index + 1]; return result; } catch (Exception e) { e.printStackTrace(); return null; }}```### Explanation:1. **ensureCapacity()**: Ensures the array backing the list has sufficient capacity. If not, it doubles the capacity and copies the existing elements into a new array with the increased size.2. **makeRoom()**: Shifts elements to make space for a new entry at the specified position. It starts from the end (lastIndex) and shifts each element one position to the right up to newIndex.3. **checkIntegrity()**: Checks if the list is in a valid state before performing operations; throws an exception if the list is corrupt.4. **remove, clear, replace, getEntry**: These method signatures are present, but their implementations are

The program is given below: import java.util.*; public class AList<T> implements…

Answered: Data structure & Algorithum java…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Data structure & Algorithum java program

1) Add a constructor to the class "AList" that creates a list from a given array of objects.
2) Add a method "getPosition" to the "AList" class that returns the position of a given object in the list. The header of the method is as follows : public int getPosition(T anObject)
3) Write a program that thoroughly tests all the methods in the class "AList".
4) Include comments to all source code.