Java 1. Implement a List using array: a. Implement ArrayList class of ListADT interface which will define the following methods (i) public T removeLast(); //Removes and returns the last element in the list. (ii) public T removeFirst(); //Removes and returns the first element in the list. (iii) public T remove(T element); //Removes and returns the specified element. (iv) public boolean contains(T target); //Return True if the list contains the target element otherwise False. (v) public String toString(); // Returns a string representation of the list. b. Implement ArrayUnorderedList class which will extends ArrayList by defining the following additional methods (i) public void addToFront(T element); //Adds the specified element to the front of the list. (ii) public void addToRear(T element); //Adds the specified element to the rear of the list. (iii) public void addAfter(T element, T target); //Adds the specified element after the specified target element. c. Create an object of ArrayUnorderedList class and perform some add, remove, and search operations and finally print the entire Stack.

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...
icon
Related questions
Question

Java

1. Implement a List using array:
a. Implement ArrayList<T> class of ListADT<T> interface which will define the following
methods
(i) public T removeLast(); //Removes and returns the last element in the list.
(ii) public T removeFirst(); //Removes and returns the first element in the list.
(iii) public T remove(T element); //Removes and returns the specified element.
(iv) public boolean contains(T target); //Return True if the list contains the target
element otherwise False.
(v) public String toString(); // Returns a string representation of the list.

b. Implement ArrayUnorderedList<T> class which will extends ArrayList<T> by defining
the following additional methods

(i) public void addToFront(T element); //Adds the specified element to the front of
the list.
(ii) public void addToRear(T element); //Adds the specified element to the rear of the
list.
(iii) public void addAfter(T element, T target); //Adds the specified element after the
specified target element.

c. Create an object of ArrayUnorderedList<T> class and perform some add, remove, and
search operations and finally print the entire Stack.  

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Operations of Linked List
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning