Create class Test in a file named Test.java. This class contains a main program that performs the following actions: Instantiate a doubly linked list. Insert strings “a”, “b”, and “c” at the head of the list using three Insert() operations. The state of the list is now [“c”, “b”, “a”]. Set the current element to the second-to-last element with a call to Tail() followed by a call to Previous()Then insert string “d”. The state of the list is now [“c”, “d”, “b”, “a”]. Set the current element to past-the-end with a call to Tail() followed by a call to Next(). Then insert string “e”. The state of the list is now [“c”, “d”, “b”, “a”, “e”] . Print the list with a call to Print() and verify that the state of the list is correct.

Create class Test in a file named Test.java. This class contains a main program that performs the following actions: Instantiate a doubly linked list. Insert strings “a”, “b”, and “c” at the head of the list using three Insert() operations. The state of the list is now [“c”, “b”, “a”]. Set the current element to the second-to-last element with a call to Tail() followed by a call to Previous()Then insert string “d”. The state of the list is now [“c”, “d”, “b”, “a”]. Set the current element to past-the-end with a call to Tail() followed by a call to Next(). Then insert string “e”. The state of the list is now [“c”, “d”, “b”, “a”, “e”] . Print the list with a call to Print() and verify that the state of the list is correct.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 5PE

See similar textbooks

Similar questions

Write a Java class myLinkedList to simulate a singly linked list using arrays as the underlying structure. Include the following methods: 1. insert an element within the linked list.(this should also work for the front and the rear of the list) 2. Remove an element from the linked list 3. Display (print) the elements of the linked list in order. 4. A method to check if the list is "empty". Test your solution using a linked list that initially has the characters A, B, D, E, F, and G. Insert "C" between B and D. Remove element "F". [Hint: One solution (recommended) is to use 2 arrays. One for the data, and the other for the "next" pointer. Also, consider using dummy nodes for the front, and possibly the rear of the list] Extend the solution so that it simulates a doubly linked list! (hint: You will need a third array to represent the "backward" pointers)
34Given that values is of type LLNode<Integer> and references a linked list (non-empty) of Integer objects, what does the following code do if invoked as mystery(values)? void mystery(LLNode<Integer> list){if (list != null){System.out.println(list.getInfo());mystery(list.getLink());}}Group of answer choicesprints the list from start to end.prints the first element on the list.prints the last element on the list.prints the list in reverse order.None of these is correct.
import java.util.ArrayList;import java.util.Arrays; public class PS07A{/*** Write the method named mesh.* * Start with two ArrayLists of String, A and B, each with * its elements in alphabetical order and without any duplicates. * Return a new list containing the first N elements from the two * lists. The result list should be in alphabetical order and without * duplicates. A and B will both have a size which is N or more. * Your solution should make a single pass over A and B, taking * advantage of the fact that they are in alphabetical order, * copying elements directly to the new list.* * Remember, to see if one String is "greater than" or "less than" * another, you need to use the compareTo() method, not the < or > * operators. * * Examples:* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]* * @param a an ArrayList of String in alphabetical…
Create a class Student with the fields: name (a String) and gpa (a double). Create a linked list of Student objects, called students using the LinkedList class from java.util.Sort the linked list students “by length” of name (see Sect. 11.3 in textbook) using the sort method from class Collections.Sort the initial linked list students by gpa using the sort method from class Collections. Apply the toArray() method from class LinkedList to the initial linked list students and sort the obtained array “by length” of name using the sort method from class Arrays. After each sort, print the result.Do NOT use the sort method from the List interface (also available from a LinkedList).
read carefully please Without using the java collections interface (i.e. do not import java.util.List, LinkedList, etc. ) I need to write a java program that inserts a new String element (String newItem) into a linked list after another specified item (String itemToInsertAfter). For example if items "A", "B", "C" and "D" are in a linked list in that order and the below method is called, insertAfter("E", "C"), then "E" would be inserted after "C", making the final list to be "A", "B", "C", "E" and "D" with no nulls or blank elements or any elements missing or anything. It should work for all lenghths of linkedlists of Strings. I am not sure how to do this simple problem, can you help? public Boolean insertAfter(String newItem, String itemToInsertAfter) { // returns true if done successfully, else returns false if itemToInsertAfter cannot be found or some other error }
Add a proper function to the following linked list that will copy all elements with value above average into another list , then apply it to the list created in main function and print your resultant list. Example: l.copy(l2); will copy all elements with value greater than average into l2 #include <iostream> using namespace std; struct node { int data; node *next,*prev; node(int d,node *p=0,node *n=0) { data=d; prev=p; next=n; } }; class list { node *head; public: list(); void print(); void add_end(int el); }; list::list() { head=0; } void list::add_end(int el) { if(head==0) head=new node(el); else { node *t=head; for(;t->next!=0;t=t->next); t->next=new node(el,t); } } void list::print() { for(node *t=head;t!=0;t=t->next) cout<<t->data<<" "; cout<<endl; } void main() { list l; l.add_end(7); l.add_end(3); l.add_end(9);…
import java.util.ArrayList;import java.util.Arrays;public class PS{/*** Write the method named mesh.** Start with two ArrayLists of String, A and B, each with* its elements in alphabetical order and without any duplicates.* Return a new list containing the first N elements from the two* lists. The result list should be in alphabetical order and without* duplicates. A and B will both have a size which is N or more.* Your solution should make a single pass over A and B, taking* advantage of the fact that they are in alphabetical order,* copying elements directly to the new list.** Remember, to see if one String is "greater than" or "less than"* another, you need to use the compareTo() method, not the < or >* operators.** Examples:* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]** @param a an ArrayList of String in alphabetical order.* @param b an…
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:
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?
Identify the following code in the image belonging to the double linked list class, assuming the linked list is made of DLLNodes and that the linked list has a first and last pointer (pick the option that would be the best name). (a) Push (b) Pop (c) Insert (d) Remove (e) Join (f) other
Python Pandas: How do I split a list into columns? I have a file like this: 1 45.40 38.99 100.33 2 44.89 89.23 23.45 3 49.90 78.82 99.32 I did the read operation: import pandas as pd df = pd.read_csv("myfile.txt") How do I get it to a column and then add it to a list? For example: A = [1,2,3] B= [45.40, 44.89, 49.90] I've tried so many different things and I'm stuck
python programming Write a function that will insert a new value into the middle of a Linked List. INPUT: The head of the Linked List, the value to insert OUTPUT: Nothing is output RETURNED: Nothing is returned