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 4PE
Program Plan Intro

A method “size()”

Program plan:

  • In a file “ListIterator.java”, create an interface “ListIterator”,
    • Declare the method “next()” that moves the iterator past the next element.
    • Declare the method “hasNext()” that check if there is an element after the iterator position.
    • Declare the method “add()”  that adds an element before the position of the iterator and moves the iterator past the added element.
    • Declare the method “remove()” that removes the last traversed element.
    • Declare the method “set()” to set the last traversed element to a previous value.
  • In a file “LinkedList.java”, import the package and create a class “LinkedList”,
    • Declare the object variable.
    • Define the constructor to create an empty linked list.
    • Define the method “size()” to compute the linked list size,
      • Initialize the variable that holds size.
      • Assign the first reference to the current node.
      • Execute a loop,
        • Increment the size.
        • Assign the next of the current node to the current node.
      • Return the linked list size.
          • Define the method “getFirst()” that returns the first element in the linked list.
          • Define the method “removeFirst()” to remove the first element in the linked list.
          • Define the method “addFirst()” that adds an element to the front of the linked list,
            • Create a new node.
            • Assign the value to the new node.
            • Assign the first element to the next pointer of new node.
            • Assign new node to the first position.
          • Define the method “listIterator()” of type “ListIterator”, that returns an iterator for iterating through the list.
          • Create a class “Node”,
            • Declare the object variable for “Object”, and “Node”.
          • Create a class “LinkedListIterator”,
            • Declare the necessary object variables.
            • Define the constructor to create an iterator that points to the front of the linked list.
            • Define the method “next()”,
              • If there is no next element then throws an exception.
              • Assign the position to the front of the linked list.
              • Check if position is null, set the first element to the position.
              • Otherwise, set the next position to the current position.
              • Returns the value.
                • Define the method “hasNext()” that check whether there is next element,
                  • Check if position is null,
                    • Returns true if first reference is not null.
                  • Otherwise,
                    • Returns true, if the next reference of the position is not null.
                • Define the method “add()”,
                  • If position is null, call the method “addFirst()”.
                    • Set the first to the position.
                  • Otherwise, create a new node.
                    • Assign the element to the new node.
                    • Set the next position to the next pointer of the new node.
                    • Set the new node value to the next position.
                    • Set the new node as the position.
                  • Set the Boolean value as false.
                • Define the method “remove()”,
                  • Check if there is no next element, throws an exception.
                  • If position is same as the first, calls the method “removeFirst()”.
                  • Otherwise, set the next position to the previous position.
                  • Set the previous to the positions.
                  • St the Boolean value to false.
                • Define the method “set()”,
                  • If there is no next element, throw an exception.
                  • Set the value to the position.
  • In a file “SizeTest.java”, create a class “SizeTest”,
    • Define the “main()” method.
      • Create the “LinkedList” object.
      • Call the method “addFirst()” to add “Tommy” to the front of the linked list.
      • Call the method “addFirst()” to add “Roma” to the font of the linked list.
      • Call the method “addFirst()” to add “Harris” to the font of the linked list.
      • Call the method “addFirst()” to add “David” to the font of the linked list.
      • Assign the value returned from the method “listIterator()” calling by  LinkedList object.
      • Call the method “next()”.
      • Call the method “next()”.
      • Call the method “remove()”.
      • Call the method “next()”.
      • Call the method “remove()”.
      • Call the method “add()” to add “John” to the linked list.
      • Call the method “next()”.
      • Call the method “set()”.
      • Call the method “removeFirst()”.
      • Assign the value returned from the method “listIterator()”.
      • Execute a loop,
        • Print the actual output.
                • Print the new line.
                • Print the expected output.
                • Print the actual size of the linked list.
                • Print the expected size of the linked list.

Blurred answer
Students have asked these similar questions
The images I have uploaded are the part 1 to 4 and questions below are continue on the questions uploaded 5. C++ Class Template with Method Stubs #pragma once #include <iostream> #include <string> #include <stdexcept> #include <vector>   template <typename T> class HashTable { private:     struct Entry {         std::string key;         T value;         bool isOccupied;         bool isDeleted;         Entry() : key(""), value(), isOccupied(false), isDeleted(false) {}     };       Entry* table;     size_t capacity;     size_t size;     double loadFactorThreshold;           size_t customHash(const std::string& key) const {         size_t hash = 5381;         for (char c : key) {             hash = ((hash  <<  5) + hash)  +  c;         }         return hash;     }       size_t probe(const std::string& key, bool forInsert = false) const;     void resize();   public:     // Constructor     HashTable(size_t initialCapacity = 101);         // Big…
this project is NOT for graded(marks) purposes, please help me with the introduction. give me answers for the project. i will include an image explaining everything about the project.
Java Graphics (Bonus In this lab, we'll be practicing what we learned about GUIs, and Mouse events. You will need to implement the following: A GUI with a drawing panel. We can click in this panel, and you will capture those clicks as a Point (see java.awt.Point) in a PointCollection class (you need to build this). The points need to be represented by circles. Below the drawing panel, you will need 5 buttons: O о о ○ An input button to register your mouse to the drawing panel. A show button to paint the points in your collection on the drawing panel. A button to shift all the points to the left by 50 pixels. The x position of the points is not allowed to go below zero. Another button to shift all the points to the right 50 pixels. " The x position of the points cannot go further than the You can implement this GUI in any way you choose. I suggest using the BorderLayout for a panel containing the buttons, and a GridLayout to hold the drawing panel and button panels. Regardless of how…

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