Create a SinglyLinkedList class function named reverse that flips the order of the list's components. The list upon which it operates should be modified by this technique, which should be destructive.

5. The following function indexCounter aims to find and return all the indices of the element x in a list L. if x is not in the list L, return an empty list. However, the implementation has a flaw, so that many times it will return error message. Can you fix the flaw? def indexCounter(L, x): indexList [] startIndex = 0 while startIndex < len(L): indexList.append (L.index (x, startIndex)) startIndex = L.index (x, startIndex) + 1 return indexList

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…

Create a ToArray function for the LinkedList class that returns an array from a linked list instance.

struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };

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. Use C++! 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    create an empty unsorted list  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().  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()..    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 line…

Assume that, you have a Linked List class "LL" with a function named "fun1". You can assume that "value" is the value of the nodes and "Next" is the next pointer of the node. You created an instance of the LL class, named "L1", where "head" is the head node. And you inserted the following numbers:  31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91. What will be the output of the linked list L1 after the "fun1" operation to it?*           31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91       31 -> 32 -> 17 -> 34 -> 57 ->91       31 -> 32 -> 43 -> 17 -> 57 ->91       31 -> 32 -> 43 -> 17 -> 34 -> 57       31 -> 32 -> 43 -> 57 ->91       31 -> 32 -> 43 -> 34 -> 57 ->91

Implement a function void printAll(void) to print all the items of the list.

ID: A Name: 9. Consider the following code segment. theList + [-2, -1, 0, 1, 2] count1 0 count2 e FOR EACH value IN theList } IF(value > 0) count1 count1 + 1 { ELSE } count2 count2 + 1 EGO { { What are the values of count1 and count2 as a result of executing the code segment? countl = 5, count2 = 0 %3D c. %3D a. countl = 2, count2 = 2 %3D countl = 2, count2 = 3 d. %3D b. count1 = 3, count2 2 %3D 9.

Which is true?   a. A LinkedList offers faster element insertion than an ArrayList   b. A List implements the LinkedList interface   c. A LinkedList implements the ArrayList interface   d. A LinkedList offers faster positional access than an ArrayList