Lab 17 Using a linked list with an iterator Build a class called LinkedListRunner with a main method that instantiates a LinkedList. Add the following strings to the linked list: aaa qqq ccc ddd еее fff gg hhh iii Build a ListIterator and use it to walk sequentially through the linked list using hasNext and next, printing each string that is encountered. When you have printed all the strings in the list, use the hasPrevious and previous methods to walk backwards through the list. Along the way, examine each string and remove all the strings that begin with a vowel. When you arrive at the beginning of the list, use hasNext and next to go forward again, printing out each string that remains in the linked list.

Lab 17 Using a linked list with an iterator Build a class called LinkedListRunner with a main method that instantiates a LinkedList. Add the following strings to the linked list: aaa qqq ccc ddd еее fff gg hhh iii Build a ListIterator and use it to walk sequentially through the linked list using hasNext and next, printing each string that is encountered. When you have printed all the strings in the list, use the hasPrevious and previous methods to walk backwards through the list. Along the way, examine each string and remove all the strings that begin with a vowel. When you arrive at the beginning of the list, use hasNext and next to go forward again, printing out each string that remains in the linked 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

Related questions

Q: Lab 17 Using a linked list with an iterator Build a class called LinkedListRunner with a main method…

A: Below is the required Java program: -

Q: in java language Write a program that implements the methods of a list using LINKED LISTS. Send…

A: Algorithm to implement Linked List Linked List contains the nodes that store the data and address…

Q: Draw out the final version of a Linked List once the following data was added (in this order): 10,…

A: Linked List: A linked list is a data structure in which each item is connected to the next item in…

Q: The following method is defined within a linked list class. What does it do? void…

A: A linked list is a linear data structure in which elements, called nodes, are connected…

Q: Complete the blanks:(Use predefined method) 1) Write the code for displaying third element of the…

A: Linked List A linked list is a linear data structure that consists of a sequence of nodes and a…

Q: Java language the top half is the class that contains the linked list parts the bottom half is…

A: Linked list implementation using java

Q: the Linked List class: import java.util.NoSuchElementException; // Linked list implementation class…

A: The Java code includes an array-based list implementation (AList) and a driver class (Main) for…

Q: Java: For the linked list implementation of the stack, where are the pushes and pops performed?…

A: Linked List can be defined as collection of objects called nodes that are randomly stored in the…

Q: How to get insert method to accept two values? Right now it accepts one, and ignores the other.…

A: Using the INSERT IGNORE statement, however, the rows with invalid data that cause the error are…

Q: I need to add an item to a linked list using a method. its an object consisting of a name, int,…

A: To add a new Person object to a linked list at a specified position, you can follow these steps:…

Q: Chu" Bethany Daryl next next next bead The above is a LinkedList. 3. Why do you not move the head…

A: A linked list is a collection of nodes that together form a linear ordering. linked list where each…

Q: Given the MileageTrackerNode class, complete main() in the MileageTracker LinkedList class to insert…

A: MileageTrackerLinkedList:Start the MileageTrackerLinkedList class.Import the necessary…

Q: Given main.py and a Node class in Node.py, complete the LinkedList class (a linked list of nodes) in…

A: The program is written in Python. Check the program screenshot for the correct indentation. Please…

Q: o Do: LinkedList.h: add a new Node* called tailPtr which points to the last item in the list…

A: I have created a variable tailPtr of type ItemType. I have also created a function signature,…

Q: QUESTION 2 6 points Save Answer Implement an items stock system using_your singly linked list from…

A: ANSWER:-

Q: Add a method: def diff(list1: LinkedList, list2: LinkedList) -> LinkedList: diff() method accepts…

Q: Consider the initial state of the linked list according to the code given at the top (ignoring the…

A: ListNode asterisk = new ListNode('*'); //a node with name asterisk is created with value '*'…

Concept explainers

Operations of Linked List

A linked lists are one of the most widely used and effective data structures, with applications in every programming language, including C, C++, Python, Java, and C#.

Question

100%

Lab 17 Using a linked list with an iterator
Build a class called LinkedListRunner with a main method that instantiates
a LinkedList<String>. Add the following strings to the linked list:
aaa
bbb
ddd
еее
fff
ggg
hhh
ii
Build a ListIterator<String> and use it to walk sequentially through the linked list
using hasNext and next, printing each string that is encountered. When you have printed all the
strings in the list, use the hasPrevious and previous methods to walk backwards through the list.
Along the way, examine each string and remove all the strings that begin with a vowel. When you
arrive at the beginning of the list, use hasNext and next to go forward again, printing out each string
that remains in the linked list.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1. Input

VIEW

Step 2. Output

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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

Create a class of type Generic so that it has a Get method that receive a list regardless of the type of this list. Print the list, remove the first and the last element in the list, reverse the list and finally print the list After modifications. Proposed methodologies:Generic Class. Technologies: - C#- Visual Studio
Start this lab with the code listed below. The LinkedList class defines the rudiments of the code needed to build a linked list of Node objects. You will first complete the code for its addFirst method. This method is passed an object that is to be added to the beginning of the list. Write code that links the passed object to the list by completing the following tasks in order:1. Create a new Node object.2. Make the data variable in the new Node object reference the object that was passed to addFirst.3. Make the next variable in the new Node object reference the object that is currently referenced in variable first.4. Make variable first reference the new Node.Test your code by running the main method in the LinkedListRunner class below. Explain, step by step, why each of the above operations is necessary. Why are the string objects in the reverse order from the way they were added? public class LinkedList{ private Node first; public LinkedList() { first = null; } public Object…
You are going to 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 homework. 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 1. create an empty unsorted list 2. 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(). 3. 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().. 4. 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…
/ This method takes as parameters a reference to the head of a linked list, a // position specified by n, and a key. It returns the number of occurrences // of the key in the linked list beginning at the n-th node. If n = 0, it means // you should search in the entire linked list. If n = 1, then you should skip // the first node in the list. public int numOccurrencesRec(LNode node, int n, int key) { // TODO: implement this method return 0; // replace this statement with your own return } } LNode Below: public class LNode{ // instance variables private int m_info; private LNode m_link; // constructor public LNode(int info) { m_info = info; m_link = null; } // member methods public void setLink(LNode link) { m_link = link; } public LNode getLink() { return m_link; } public int getInfo() { return m_info; } }
SingleLinkedList head- Node next - data- String value = "Tom" Node next- data- String value = "Dick" Node nodeRef = nodeRef.next; nodeRef.next = new Node("Peter"); next- data- String value="Harry" What change will be made to the list after the following codes are run? Node nodeRef = head; While (nodeRef.next!=null) Node next = null data- String value="Sam"
Java Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts Second image is ItemNode
In Java please help with the following: Sees whether this list is empty.@return True if the list is empty, or false if not. */ public boolean isEmpty(); } // end ListInterface Hint:Node class definition should look something like: public class Node<T> { T element; Node next; Node prev; public Node(T element, Node next, Node prev) { this.element = element;this.next = next;this.prev = prev; } }
JAVA please Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts Code provided in the assignment ItemNode.java:
Instruction: To test the Linked List class, create a new Java class with the main method, generate Linked List using Integer and check whether all methods do what they’re supposed to do. A sample Java class with main method is provided below including output generated. If you encounter errors, note them and try to correct the codes. Post the changes in your code, if any. Additional Instruction: Linked List is a part of the Collection framework present in java.util package, however, to be able to check the complexity of Linked List operations, we can recode the data structure based on Java Documentation https://docs.oracle.com/javase/8/docs/api/java/util/LinkedList.html package com.linkedlist; public class linkedListTester { public static void main(String[] args) { ListI<Integer> list = new LinkedList<Integer>(); int n=10; for(int i=0;i<n;i++) { list.addFirst(i); } for(int…
Given the interface of the Linked-List struct Node{ int data; Node* next = nullptr; }; class LinkedList{ private: Node* head; Node* tail; public: display_at(int pos) const; ... }; Write a definition for a method display_at. The method takes as a parameter integer that indicates the node's position which data you need to display. Example: list: 5 -> 8 -> 3 -> 10 display_at(1); // will display 5 display_at(4); // will display 10 void LinkedList::display_at(int pos) const{ // your code will go here }
Implement a Single linked list to store a set of Integer numbers (no duplicate) • Instance variable• Constructor• Accessor and Update methods 3. Define TestSLinkedList Classa. Declare an instance of the Single List class.b. Test all the methods of the Single List class.
Send me your own work not AI generated response or plagiarised response. If I see these things, I'll give multiple downvotes and will definitely report.