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. public class AList implements ListInterface {private T[] list;private int number0fEntries;private boolean integrity0K;private static final int DEFAULT CAPACITY =private static final int MAX CAPACITY =25;1000;public AList() throws Exception {this(DEFAULT CAPACITY);public AList(int initialCapacity) throws Exception {= false;integrityOK// is capacity too small?if(initialCapacity < DEFAULT_CAPACITY)initialCapacity= DEFAULT CAPACITY;elsecheckCapacity(initialCapacity);(T[]) new Object[initialCapacity + 1];T[] tempList =list = tempList;number0fEntries = 0;integrityOK%3Dtrue;private void checkCapacity(int capacity) throws Eception {if(capacity > MAX_CAPACITY)throw new Exception ("Attempt to create a list whos capacity exceeds the max.");}@Overridepublic void add(T newEntry) {add (number0fEntries + 1, newEntry);@Overridepublic void add(int newPosition, T newEntry) {try {checkIntegrity();if((newPosition >= 1) && (newPosition <= number0fEntries + 1)) {if(newPosition <= numberOfEntries)makeRoom(newPosition);list[newPosition] = newEntry;numberofEntries++;ensureCapacity();%3D} catch(Exception e) {System.out..println(e.getMessage (0);private void ensureCan private void ensureCapacity() throws Exception {= list.lengthif (numberofEntries >= capacity) {int capacity1;int newCapacity = 2 * capacity;checkCapacity(newCapacity);list =Arrays.copy0f(list, newCapacity + 1);%3Dprivate void makeRoom(int newPosition) {int newIndex =newPosition;int lastIndex = number0fEntries;for (int index = lastIndex; index >= newIndex; index--) {list[index + 1] = list[index];private void checkIntegrity() throws Exception {if(lintegrityOK)throw new Exception("AList object is corrupt.");}@Overridepublic T remove (int givenPosition) {// TODO Auto-generated method stubreturn null;@Overridepublic void clear() {// TODO Auto-generated method stub@overridepublic T replace(int givenPosition, T newEntry) {// TODO Auto-generated method stubreturn null;@overridepublic T getEntry(int givenPosition) {// TODO Auto-generated method stubreturn null;@overridepublic T[] toArray() {try {checkIntegrity();T[] result = (T[]) new Object[numberofEntries];for (int index = 0; index < number0fEntries; index++)result[index] = list[index + 1];%3Dreturn result;} catch (Exception e) {e.printStackTrace();return null;

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.