in java language Write a program that implements the methods of a list using LINKED LISTS. Send source code Create a menu with an option for each of the list methods. END(L) PRINT_LIST(L) INSERT(x,p,L) LOCATE(x, L) RECOVER(p,L) DELETE(p, L) NEXT(p,L) PREVIOUS(p,L) DESTROY(L) FIRST(L) EMPTY(L) Val

The elements of a linked list are guaranteed to be contiguous in memory.A. True B. False

python language Write the lines of code that will print out all of the data in a Linked List.

in Jave create a method work() with the follow instructions: If the work() method is passed a non-null then it must return a new List that contains some or all of the elements in data. The elements of the new List must be aliases for (not copies of) the objects in the List it is passed. If there are no sign attributes (i.e., the array is null or has 0 elements) then the work() method must return an empty List. If any of the conditions represented by the sign attribute holds for a particular element that that element must be included in the result (i.e., the conditions must be combined using a logical OR). The elements in the returned List must be in the same order they appeared in the original List (though not all elements must be in the result). public List<T> work(List<T> g){

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

This is using Data Structures in Java

Write a program that lets the user enter numbersfrom a graphical user interface and displays them in a text area, as shownin Figure a. Use a linked list to store the numbers. Do not store duplicatenumbers. Add the buttons Sort, Shuffle, and Reverse to sort, shuffle, andreverse the list.

The tail of a linked list is distinguished from other nodes because its next pointer is:A. void B. empty C. NULL D. None of the above.

Which best describes this axiom: aList.getLength ( ) = ( aList.remove ( i ) ) . getLength ( ) + 1 You cannot remove an item from from existing list that is empty Removing an item from an existing list decreases its length by one Removing an item from an existing list increases the list size by one None of these