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 bbb ссс ddd eee hhh ii 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 bbb ссс ddd eee hhh ii 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.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: intersect ♡ Language/Type: Related Links: Write a method named intersect that accepts references to…

A: The answer of this question is as follows:

Q: Write a non-member method for a "enqueue" that utilizes a doubly linked list. There are three…

A: BELOW ? COMPLETE SOLUTION REGARDING YOUR PROBLEMREGARDING

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: struct nodeType { int infoData; nodeType * next; }; nodeType *first; … and…

A: The algorithm to write the function with the given description: Include a while function, that will…

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: In Java, The following is a class definition of a linked list Node: class Node { int info; Node…

A: A linked list is a linear data structure that is dynamic in nature.It consists data and address…

Q: · Write a method to insert an element at index in a Doubly Linked List data structure and test it.…

A: Given :-Write a method to insert an element at index in a Doubly Linked List data structure and test…

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: rarestAge Language/Type: Related Links: Write a method named rarestAge that accepts as a parameter a…

A: In this problem, we are required to write a method named rarestAge that accepts a HashMap containing…

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: In java, how do I implement the following methods into a linkedlist class. 1) removeLast() – remove…

A: Java: Java is a high level, general purpose programming language. It is robust and secured language.…

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 '*'…

Q: Create a class of type Generic so that it has a Get method that receive a list regardless of the…

A: In system, A generic type of collection, which is defined in C# is known as Linked list. In order to…

Q: Start this lab with the code listed below. The LinkedList class defines the rudiments of the code…

A: Attached Source code in Java: LinkedList.java import java.util.*; public class LinkedList { private…

Q: What do you mean by a list that is linked twice?

A: Find Your Code Below

Q: Question-1 1- Get width from user. 2- Get height from user. 3- Calculate the area. 4- Draw a turtle…

A: Turtle program in python to draw a rectangle and fill color

Q: In Java, a linked list always terminates with a node that is null

A: Each node has a single next element that moves the list forward, and all nodes have list element…

Question

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
cc
ddd
eee
fff
ggg
hhh
iii
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

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

Linked List, create your own code. (Do not use the build in function or classes of Java or from the textbook). Create a LinkedList class: Call the class MyLinkedList, (hint) Create a second class called Node.java and use it, remember in the class I put the Node class inside the LinkedList Class, but you should do it outside. This class should haveo Variables you may need for a Node,o (optional) Constructor Your linked list is of an int type. (you may do it as General type as <E>) For this Linked List you need to have the following methods: add, addAfter, remove, size, contain, toString, compare, addInOrder. This is just a suggestion, if you use Generic type, you must modify this Write a main function or Main class to test all the methods,o Create a 2 linked list and test all your methods. (Including the compare)
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"
Has to be done in Java. Import ArrayList.
File TesSLL.java contains a driver that allows you to experiment with these methods. Compile and run TestSLL, and play around with it to see how it works. Then add the following methods to the SinglyLinkedList class. For each, add an option to the driver to test it. Do this in incremental steps!! This means, implement and test the methods one at a time.
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; } }
Pythong help!
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 }
This is using Data Structures in Java
Linked List, create your own code. (Do not use the build in function or classes of Java or from the textbook). Create a LinkedList class: Call the class MyLinkedList, (hint) Create a second class called Node.java and use it, remember in the class I put the Node class inside the LinkedList Class, but you should do it outside. This class should haveo Variables you may need for a Node,o (optional) Constructor Your linked list is of an int type. (you may do it as General type as <E>) For this Linked List you need to have the following methods: add, addAfter, remove, size, contain, toString, compare, addInOrder. This is just a suggestion, if you use Generic type, you must modify this Write a main function or Main class to test all the methods,o Create a 2 linked list and test all your methods. (Including the compare)
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.
Given the following definition for a LinkedList: // LinkedList.h class LinkedList { public: LinkedList(); // TODO: Implement me void printEveryOther() const; private: struct Node { int data; Node* next; }; Node * head; }; // LinkedList.cpp #include "LinkedList.h" LinkedList::LinkedList() { head = nullptr; } Implement the function printEveryOther, which prints every other data value (i.e. those at the odd indices assuming 0-based indexing).