You are familiar with ArrayList and have used it in different capacities. The most prominent feature of ArrayList is that it expands automatically as elements are added to it. It can be traversed using a for loop, for each loop and iterator( which you have implemented in Lab 2). In this lab you are going to implement your own ArrayList and its functionalities. Task 1.1: Create a class Generic ArrayList with attributes. Task 1.2: Implement a constructor for your ArrayList class. Task 1.3: Implement add() method for adding elements to ArrayList. Remember, ArrayList adds elements dynamically. It doesn't depend on user defined size. Task 1.4: Implement remove() method for removing an element from a specific index. Remember, ArrayList stores elements in a consecutive sequence. If an element is removed from middle you have to re-adjust the elements in the correct sequence. Note: Break down your implementation by defining helper methods for different tasks, rather than implementing your logic in a single method.

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...
icon
Related questions
Question

You are familiar with ArrayList and have used it in different capacities. The most prominent feature of ArrayList is that it expands automatically as elements are added to it. It can be traversed using a for loop, for each loop and iterator( which you have implemented in Lab 2).
In this lab you are going to implement your own ArrayList and its functionalities.
Task 1.1: Create a class Generic ArrayList with attributes.
Task 1.2: Implement a constructor for your ArrayList class.
Task 1.3: Implement add() method for adding elements to ArrayList. Remember, ArrayList adds elements dynamically. It doesn't depend on user defined size.
Task 1.4: Implement remove() method for removing an element from a specific index. Remember, ArrayList stores elements in a consecutive sequence. If an element is removed from middle you have to re-adjust the elements in the correct sequence.

Note: Break down your implementation by defining helper methods for different tasks, rather than implementing your logic in a single method.

Expert Solution
steps

Step by step

Solved in 5 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY