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. 2. Using Linked structure, implement LinkedList class 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. a. Implement LinkedUnorderedList class which will extends LinkedList 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. b. Create an object of ArrayUnorderedList class and perform some add, remove, and search operations and finally print the entire list using iterator. c. Create an object of LikedUnorderedList class and perform the same set of add, remove, and search operations of 2(b) and finally print the entire list using iterator. If your array and linked based implementations are right, you should get the same result

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. 2. Using Linked structure, implement LinkedList class 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. a. Implement LinkedUnorderedList class which will extends LinkedList 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. b. Create an object of ArrayUnorderedList class and perform some add, remove, and search operations and finally print the entire list using iterator. c. Create an object of LikedUnorderedList class and perform the same set of add, remove, and search operations of 2(b) and finally print the entire list using iterator. If your array and linked based implementations are right, you should get the same result

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

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.

2. Using Linked structure, implement LinkedList<T> class 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.

a. Implement LinkedUnorderedList<T> class which will extends LinkedList<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.

b. Create an object of ArrayUnorderedList<T> class and perform some add, remove, and
search operations and finally print the entire list using iterator.

c. Create an object of LikedUnorderedList<T> class and perform the same set of add,
remove, and search operations of 2(b) and finally print the entire list using iterator. If
your array and linked based implementations are right, you should get the same result.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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.