EBK BIG JAVA: EARLY OBJECTS, INTERACTIV
EBK BIG JAVA: EARLY OBJECTS, INTERACTIV
6th Edition
ISBN: 8220102010314
Author: Horstmann
Publisher: YUZU
Question
Book Icon
Chapter 16, Problem 9PE
Program Plan Intro

Simplified implementation of “ArrayList” class

Program plan:

  • In a file “ArrayList.java”, import necessary packages and create a class “ArrayList” that implements “Iterable” interface,
    • Declare the object variable.
    • Declare the necessary variable.
    • Define the constructor to create an empty array list.
    • Define the method “size()” to return the array list size.
    • Define the method “checkBounds()” that throws an exception if the index that has been checked is out of bounds.
    • Define the method “get()” that returns an element at a given position.
    • Define the method “set()” that locates the element at a given position.
    • Define the method “remove()” that removes an element at a given location.
      • Call the method “checkBounds()”.
      • Assign the element.
      • Create a loop,
        • Assign the current element to the previous location.
      • Decrement the size.
      • Return the element.
    • Define the method “add()” to insert the element next to the given position.
    • Define the method “addHere()”,
      • Call the method “add()”.
    • Define the method “addLast()” that insert the element next to the end of the array list.
    • Define the method “growBufferIfNecessary()” that grow the buffer the buffer if the current size is same as the capacity of the buffer.
    • Define the method “iterator()” of type “ArrayListIterator”,
      • Return the object of “ArrayListIterator”.
    • Create a class “ArrayListIterator”,
      • Declare the necessary variables.
      • Define the constructor to create an iterator.
      • Define the method “add()” that inserts an element before the position of the iterator.
      • Define the method “hasNext()” that checks whether there is an element next to the iterator position.
      • Define the method “hasPrevious()” that checks whether there is an element before the iterator position.
      • Define the method “next()” that moves the iterator past the succeeding element.
      • Define the method “nextIndex()”,
        • Check whether the next position is greater than the current size,
          • If it is true, returns the position.
            • Returns the next position.
      • Define the method “previous()”,
        • Check whether there is not a previous element,
          • If it is true, throws an exception.
            • Decrement the position.
            • Returns the function call.
      • Define the method “previousIndex()”,
        • Check whether there is the previous position id greater than “0”,
          • If it is true, returns the position.
            • Returns the previous position.
      • Define the method “remove()” that removes the last traversed element.
      • Define the method “set()” that assign last traversed element to the different value.
  • In a file “ListTest.java”, create a class “ListTest”,
    • Define the “main()” method.
      • Create an “ArrayList” object.
      • Call the method “addLast()” to add the element “David”.
      • Call the method “addLast()” to add the element “Harris”.
      • Call the method “addLast()” to add the element “Roman”.
      • Call the method “addLast()” to add the element “Tommy”.
      • Create a loop,
        • Print the actual output.
      • Print new line.
      • Print the expected output.

Blurred answer
Students have asked these similar questions
using r language
using r language
The assignment here is to write an app using a database named CIT321 with a collection named students; we will provide a CSV file of the data. You need to use Vue.js to display 2 pages. You should know that this assignment is similar, all too similar in fact, to the cars4sale2 example in the lecture notes for Vue.js 2. You should study that program first. If you figure out cars4sale2, then program 6 will be extremely straightforward. It is not my intent do drop a ton of new material here in the last few days of class. The database contains 51 documents. The first rows of the CSV file look like this: sid last_name 1 Astaire first_name Humphrey CIT major hrs_attempted gpa_points 10 34 2 Bacall Katharine EET 40 128 3 Bergman Bette EET 42 97 4 Bogart Cary CIT 11 33 5 Brando James WEB 59 183 6 Cagney Marlon CIT 13 40 GPA is calculated as gpa_points divided by hrs_attempted. GPA points would have been arrived at by adding 4 points for each credit hour of A, 3 points for each credit hour of…

Chapter 16 Solutions

EBK BIG JAVA: EARLY OBJECTS, INTERACTIV

Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education