Starting Out with Java: From Control Structures through Data Structures (3rd Edition)
Starting Out with Java: From Control Structures through Data Structures (3rd Edition)
3rd Edition
ISBN: 9780134038179
Author: Tony Gaddis, Godfrey Muganda
Publisher: PEARSON
bartleby

Concept explainers

Question
Book Icon
Chapter 20, Problem 1PC
Program Plan Intro

Generic Linked Lists

Program Plan:

  • Import required package.
  • Define “GenericLinkedList” class.
    • Define “Node” class.
      • Declare a value of a list element in generic type.
      • Declare next node in the list using “Node” class.
      • Parameterized constructor for “Node” class with two parameters.
      • Parameterized constructor for “Node” class with one parameter.
    • Declare variable for head of the list.
    • Declare variable for last element of list.
    • Define the method “clear()” which is used to remove all elements from the list.
      • Initializes the index to “0”.
      • If the head of the list is not “null”, then set temp node to head of the list and performs “while” loop.
        • Remove an element in the list one by one using “while” loop.
          • Set “temp_node” to next value of “temp_node”.
          • Remove the given element by calling the method “remove”.
    • Define the method “get()” which is used to return the value at given index in the list.
      • Initializes “idx” to “0”.
      • If the head of the list is not null, then
        • Set head of list to “tempValue”.
        • Check condition using “while” loop.
          • If “idx” equals to given “index”, then return the element at given position.
          • Otherwise, increment the value of “idx” and set “tempValue” to next value of “tempValue”
    • Define the method “set()” which is used to replace the value at the specified position with the specified element and also return the previous element.
      • Initializes “idx” to “0”.
      • Check condition using “while” loop.
        • If “idx” equals to given “index”, then replace the element at given position and return the previous element.
        • Otherwise, increment the value of “idx” and set “tempValue” to next value of “tempValue”.
    • Define the method “isEmpty()” which is used to compute whether list is in empty or not.
    • Define the method “size()” which is used to compute the size of list.
    • Define the method “add()” which is used to add an element to the list.
    • Define the method “remove” which is used to remove an element from the list.
    • Define main function.
      • Create object for “Scanner” class.
      • Create object “list” in “double” type using “GenericLinkedList” class.
      • Add elements to “list” using “add()” method.
      • Display the elements in list.
      • To test the “set” method.
        • Initializes the index to “-1”.
        • Declare variable in “double” type.
        • Performs “do-while” loop.
          • Read index string from user.
          • Convert the string value in integer.
          • If the user entered index is less than “0” or greater than or equal to “size”, then display an error message.
        • Read the new element for given index.
        • Convert the string to double.
        • Replace the new element in the place of old element by calling the method “set”.
        • Display the old element in the given index.
        • Display the list after calling “set” method.
            • To test the “get” method.
              • Initializes the index to “-1”.
              • Performs “do-while” loop.
                • Read the index from user.
                • Convert the string to integer.
                • If the user entered index is less than “0” or greater than or equal to “size”, then display an error message
              • Display the element at given index by calling the method “get()”.
            • Clear all the elements in the list by calling the method “clear()”.
            • Display the size of list after clearing the list by calling “size()” method.

Blurred answer
Students have asked these similar questions
data structure-JAVA
Part2: LinkedList implementation 1. Create a linked list of type String Not Object and name it as StudentName. 2. Add the following values to linked list above Jack Omar Jason. 3. Use addFirst to add the student Mary. 4. Use addLast to add the student Emily.  5. Print linked list using System.out.println(). 6. Print the size of the linked list. 7. Use removeLast. 8. Print the linked list using for loop for (String anobject: StudentName){…..}  9. Print the linked list using Iterator class. 10. Does linked list hava capacity function?  11. Create another linked list of type String Not Object and name it as TransferStudent. 12. Add the following values to TransferStudent linked list Sara Walter. 13. Add the content of linked list TransferStudent to the end of the linked list StudentName 14. Print StudentName. 15. Print TransferStudent. 16. What is the shortcoming of using Linked List?
6. Suppose that we have defined a singly linked list class that contains a list of unique integers in ascending order. Create a method that merges the integers into a new list. Note the additional requirements listed below. Notes: ● . Neither this list nor other list should change. The input lists will contain id's in sorted order. However, they may contain duplicate values. For example, other list might contain id's . You should not create duplicate id's in the list. Important: this list may contain duplicate id's, and other list may also contain duplicate id's. You must ensure that the resulting list does not contain duplicates, even if the input lists do contain duplicates.
Knowledge Booster
Background pattern image
Computer Science
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.
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