3.2. Write a Java method for the class SinglyLinkedList called removeSubList (...) that receives a linked list as a parameter. All elements in the parameter linked list must be removed from the calling linked list. Eg: Calling list = {1,2,3,4,5,6) parameter list = (3.4.5) final list (1.2.6) 3.3. Write a driver program to test the removeSubList () method with a SinglyLinkedList using the values of the examples provided in 3.2. (Remember to display the SinglyLinkedList after removeSubList () was called you can assume a toString() method for the SinglyLinked List class that returns a string containing all elements within the list).

3.2. Write a Java method for the class SinglyLinkedList called removeSubList (...) that receives a linked list as a parameter. All elements in the parameter linked list must be removed from the calling linked list. Eg: Calling list = {1,2,3,4,5,6) parameter list = (3.4.5) final list (1.2.6) 3.3. Write a driver program to test the removeSubList () method with a SinglyLinkedList using the values of the examples provided in 3.2. (Remember to display the SinglyLinkedList after removeSubList () was called you can assume a toString() method for the SinglyLinked List class that returns a string containing all elements within the list).

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Java Program, Dont Copy Consider a class Student that has an attribute age and a method getAge(): StudentList is a class representing a linkedlist of students. Write sumListAge_lterative......), a method that computes and returns the sum of the ages of all students in the list using the iterative way. Parameters of the method should be specified accordingly
2) Suppose you have a linked list class that provides the following methods: // constructor. // returns size of the list. LinkList () int size (); void insertHead (Object data) // insert new data at the head of // the list. // remove and return the Object at // the head of the list. Object removeHead () void insertTail (Object data) // insert new data at the tail of // the list. The class below is an implementation of a stack using the linked list class. Fill in the method implementations: class Stack { private Stack s; public Stack () { public void push (Object x) { } public Object pop () // assume stack is not empty { } public boolean isEmpty() { }
Java: Write a method/programme that will take a generic linked list and make a palindrome of the list. In a seperate test programme the user can add any elements to the generic list and then this list must be made a palindrome. The output should be the original list with the palindrome list added to this list.
Given a ListItem class, complete main() using the built-in LinkedList type to create a linked list called shoppingList. The program should read items from input (ending with -1), adding each item to shoppingList, and output each item in shoppingList using the printNodeData() method. Ex. If the input is: milk bread eggs waffles cereal -1 the output is: milk bread eggs waffles cereal ListItem.java (read only) public class ListItem {private String item; public ListItem() {item = "";} public ListItem(String itemInit) {this.item = itemInit;} // Print this node public void printNodeData() {System.out.println(this.item);}} ShoppingList.java import java.util.Scanner;import java.util.LinkedList; public class ShoppingList {public static void main (String[] args) {Scanner scnr = new Scanner(System.in); // TODO: Declare a LinkedList called shoppingList of type ListItem String item;// TODO: Scan inputs (items) and add them to the shoppingList LinkedList// Read inputs until a -1 is input// TODO:…
Exercise #2 Consider the following linked list L. header 1 3 2 5 a. Write the method AddLast, which Adds a node at the end of the list. Input: int x output: none b. Write the method updateSecond, which updates the data of the second node. Input: int x output: none c. Ifx=7, redraw the list after execution the AddLast and updateSecond methods.
Given a ListItem class, complete main() using the built-in LinkedList type to create a linked list called shoppingList. The program should read items from input (ending with -1), adding each item to shoppingList, and output each item in shoppingList using the printNodeData() method. Ex. If the input is: milk bread eggs waffles cereal -1 the output is: milk bread eggs waffles cereal ShoppingList.java import java.util.Scanner;import java.util.LinkedList; public class ShoppingList {public static void main (String[] args) {Scanner scnr = new Scanner(System.in); // TODO: Declare a LinkedList called shoppingList of type ListItem String item;// TODO: Scan inputs (items) and add them to the shoppingList LinkedList// Read inputs until a -1 is input// TODO: Print the shoppingList LinkedList using the printNodeData() method }} ListItem.java public class ListItem {private String item; public ListItem() {item = "";} public ListItem(String itemInit) {this.item = itemInit;} // Print this node…
Write the following method in Java: public void reverse() The method will reverse the linked list. Head will point to the last node of the linked list and all the pointers (addresses) will be reversed. The last node (a new head) will point to the second last node and so on. The old head node will become the tail node in the reversed LinkedList. Use the LinkedList class discussed in the video lecture and write the reverse() method in the same class. Test your method in the main method. Following picture depicts the reversal of the LinkedList. NULL Head I V R I ↑ Head > NULL
Assume that numbers are represented in linked Isits (i.e. the number 567 will be represented in linked list of three nodes; the first node contains 5, the second node contains 6 and the last nod contains 7. Write a java method that receives the heads of two linked lists representing two numbers and finds the sum list and returns its head. Assume that the linked list class is ready and called (MyLinkedList) that contains nodes with int data, and next reference. Assume also that the following methods are available on hand: addFirst(), addLast(), addAtīndex(), removeFirst(), removelast(), removeAtIndex(), size()- Note: You are free to use any data structure (queue, stack, set, map, tree) in your solution.
Write a program that implements a double linked list. The MyLinked List class used in Listing 24.5 is a on-way directional linked list that enables one-way traversal of the list. Modify the Node class to add the new data field named previous to refer to the previous node in the list, as follows: public class Node { E element; Node next; Node previous; public Node (E e){ element = e; } } Implement a new class named TwoWayLinked List that uses a doubly linked list to store elements. Define TwoWayLinked List to implement MyList. You need to implmeent all the methods defined in MyLinkedList as well as the methods listIterator() and listInterator(int index). Both return an instance of java.util.ListIterator (see figure 20.4 in the text book). The former sets the cursor to the head of the list adn the latter to the element at the specified index.
Implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this. Use C++! The “data.txt” file has three lines of data 100, 110, 120, 130, 140, 150, 160 100, 130, 160 1@0, 2@3, 3@END You need to create an empty unsorted list add the numbers from the first line to list using putItem() function. Then print all the current keys to command line in one line using printAll(). delete the numbers given by the second line in the list by using deleteItem() function. Then print all the current keys to command line in one line using printAll().. putItem () the numbers in the third line of the data file to the corresponding location in The list. For example, 1@0 means adding number 1 at position 0 of the list. Then print all the current keys to command line in one line…
Write a Java program which stores three values by using singly linked list.- Node class1. stuID, stuName, stuScore, //data fields2. constructor3. update and accessor methods- Singly linked list class which must has following methods:1. head, tail, size// data fields2. constructor3. update and accessor methodsa. getSize() //Returns the number of elements in the list.b. isEmpty( ) //Returns true if the list is empty, and false otherwise.c. getFirstStuID( ), getStuName( ), getFirstStuScore( )d. addFirst(stuID, stuName, stuScore)e. addLast(stuID, stuName, stuScore)f. removeFirst ( ) //Removes and returns the first element of the list.g. displayList( ) //Displays all elements of the list by traversing the linked list.- Test class – initialize a singly linked list instance. Test all methods of singly linked list class
Java Program Consider a class Student that has an attribute age and a method getAge(): StudentList is a class representing a linkedlist of students. Write sumListAge_lterative......), a method that computes and returns the sum of the ages of all students in the list using the iterative way. Parameters of the method should be specified accordingly