Make a data structure that enables the access and delete actions. If the item isn't already on the data structure, the access action adds it. The object with the least recent access is deleted and returned by the remove operation. Hint: Maintain references to the first and last nodes as well as the items' order of access in a doubly linked list. Use a symbol table where the keys represent the items and the values the links in the list. Remove the element from the linked list after accessing it, then reintroduce it at the start. Delete an element from the end and from the symbol table whenever you remove one.

List food_list contains words read from the first line of input. List food_allergies contains words read from the second line of input. For each element in food_list that is also in food_allergies: Output the element, followed by ' avoided'. Remove the element from food_list.

Lab 19 Building a linked list 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 () {…

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"

Question 44  Computer Science A list of elements has a size of 100. Choose the operations where an ArrayList would be faster than a LinkedList. (Select all that apply) Question 5 options:     removing from index 99       inserting at index 1       removing from index 4       inserting at index 4    Full explain this question and text typing work only

In jave

write a program for a library automation which gets the isbn number, name, author and publication year of the books in the library. the status will be filled by the program as follows: if publication year before 1985 the status is reference else status is available, the information about the books should be stored inside a linked list. the program should have a menu and the user inserts, displays, and deletes the elements from the menu by write a selecting options. the following data structure should be used. struct list char isbn[ 20 ]: char namei 20 ]. char authori 20 ]: int year; char status[200j: struct list "next, jinfo, wedoad n un posn ag pinogs nuu sulnogoj l press 1. to insert a book press 2. to display the book list press 3. to delete a book from list

Draw how an item can be added to the front of a doubly linked list. (show the steps in multiple pictures)

You may have found it somewhat tedious and unpleasant to use the debugger and visualizer to verify the correctness of your addFirst and addLast methods. There is also the problem that such manual verification becomes stale as soon as you change your code. Imagine that you made some minor but uncertain change to addLast]. To verify that you didn't break anything you'd have to go back and do that whole process again. Yuck. What we really want are some automated tests. But unfortunately there's no easy way to verify correctness of addFirst and addLast] if those are the only two methods we've implemented. That is, there's currently no way to iterate over our list and get bad its values and see that they are correct. That's where the toList method comes in. When called, this method returns a List representation of the Deque. For example, if the Deque has had addLast (5) addLast (9) addLast (10), then addFirst (3) called on it, then the result of toList() should be a List with 3 at the…

Create a random sized linked list of randomly generated integers. Insert 25 to 75 random integers in the inclusive range 0 to 100 into the linked list. Display the contents, the sum, the count, and average of the integers. Create a program named LastnameFirstname17.c, that does the following: Define a structure named node that stores a single integer and a pointer to another node. You may use the struct definition in linkedlist.c as a template to get started. Keep in mind that the data in the linkedlist.c example was a string implemented as a char[]. For this assignment, the data is an integer, just a single int. You may want to define a typedef to create alias' for the node structure and node pointer for convenience. Setup your program to generate random numbers. Import the necessary includes and seed the random function. Generate a random integer between 25 and 75, inclusive, this number will be the size of the linked list. The size of the linked list: int size = 25 + rand()…