Big Java Late Objects
Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 16, Problem 10PE
Program Plan Intro

A method “removeLast()”

Program plan:

  • In a file “ArrayList.java”, create a class “ArrayList”,
    • Declare the object variable.
    • Declare the necessary variable.
    • Define the constructor to create an empty array list.
    • Define the method “removeLast()”,
      • Check if the current size is less than “1”,
        • If it is true, throws an exception.
      • Assign the value.
      • Decrement the size.
      • Call the method “shrinkIfNecessary()”.
      • Return the object.
    • Define the method “shrinkIfNecessary()’,
      • Compute the ratio.
      • Check if the ratio is less than “0.25”,
        • Create the array.
        • Create  a loop,
          • Assign the element of the buffer to the new buffer.
            • Assign the new buffer to the old buffer.
    • 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 “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.
  • 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”.
      • Call the method “removeLast()”.
      • Call the method “removeLast()”.
      • Create a loop,
        • Print the actual output.
      • Print new line.
      • Print the expected output.

Blurred answer
Students have asked these similar questions
I would like to get help to resolve the following case
Last Chance Securities The IT director opened the department staff meeting today by saying, "I've got some good news and some bad news. The good news is that management approved the payroll system project this morning. The new system will reduce clerical time and errors, improve morale in the payroll department, and avoid possible fines and penalties for noncompliance. The bad news is that the system must be installed by January 1st in order to meet new federal reporting rules, all expenses from now on must be approved in advance, the system should have a modular design if possible, and the vice president of finance would like to announce the new system in a year-end report if it is ready by mid-December." Tasks 1. Why is it important to define the project scope? How would you define the scope of the payroll project in this case? 2. Review each constraint and identify its characteristics: present versus future, internal versus exter- nal, and mandatory versus desirable. 3. What…
2. Signed Integers Unsigned binary numbers work for natural numbers, but many calculations use negative numbers as well. To deal with this, a number of different methods have been used to represent signed numbers, but we will focus on two's complement, as it is the standard solution for representing signed integers. 2.1 Two's complement • Most significant bit has a negative value, all others are positive. So, the value of an n-digit -2 two's complement number can be written as: Σ2 2¹ di 2n-1 dn • Otherwise exactly the same as unsigned integers. i=0 - • A neat trick for flipping the sign of a two's complement number: flip all the bits (0 becomes 1, or 1 becomes 0) and then add 1 to the least significant bit. • Addition is exactly the same as with an unsigned number. 2.2 Exercises For questions 1-3, answer each one for the case of a two's complement number and an unsigned number, indicating if it cannot be answered with a specific representation. 1. (15 pts) What is the largest integer…

Chapter 16 Solutions

Big Java Late Objects

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