Data Structures , Code C++ Suppose that p, q, and r are all pointers to nodes in a linked list with 15 nodes. The pointer p points to the first node, q points to the 8th node, and r points to the last node. Write a few lines of code that will make a new copy of the list. You code should set THREE new pointers called x, y, and z so that: x points to the first node of the copy, y points to the 8th node of the copy, and z points to the last node of the copy.

IN C LANGUAGE When inserting a node into a linked list, where (in memory) will that node be placed if there is no overflow?                                                                                                                                    A) The location of the AVAIL pointer B) The next contiguous spot of memory from the last node C) The very end of the contiguous memory block D) A randomized memory location

IN PYTHON Linked Lists Consider the implementation of the Linked list class, implement the following functions as part of the class: index(item) returns the position of item in the list. It needs the item and returns the index. Assume the item is in the list. 
 pop() removes and returns the last item in the list. It needs nothing and returns an item. Assume the list has at least one item. 
 pop_pos(pos) removes and returns the item at position pos. It needs the position and returns the item. Assume the item is in the list. 
 a function that counts the number of times an item occurs in the linked list a function that would delete the replicate items in the linked list (i.e. leave one occurrence only of each item in the linked list) Your main function should do the following: Generate 15 random integer numbers in the range from 1 to 5. Insert each number (Item in a node) in the appropriate position in a linked list, so you will have a sorted linked list in ascending order. Display the…

1)Write a Java program which stores three values by using singly linked list.- Node class1. stuID, stuName, stuScore, //data fields2. constructor3. update and accessor methods- Singly linked list class which must has following methods:1. head, tail, size// data fields2. constructor3. update and accessor methodsa. getSize() //Returns the number of elements in the list.b. isEmpty( ) //Returns true if the list is empty, and false otherwise.c. getFirstStuID( ), getStuName( ), getFirstStuScore( )d. addFirst(stuID, stuName, stuScore)e. addLast(stuID, stuName, stuScore)f. removeFirst ( ) //Removes and returns the first element of the list.g. displayList( ) //Displays all elements of the list by traversing the linked list.- Test class – initialize a singly linked list instance. Test all methods of singly linked list class.       2. Write a Java program which stores three values by using doubly linked list.- Node class4. stuID, stuName, stuScore, //data fields5. constructor6. update and…

Write C code that implements a soccer team as a linked list. 1. Each node in the linkedlist should be a member of the team and should contain the following information: What position they play whether they are the captain or not Their pay 2. Write a function that adds a new members  to this linkedlist at the end of the list.

please answer

Assume a linked list contains following integers: 2, 2, 4, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; Node<int> *aNode; while(curNode->getItem()<7){        aNode=curNode;        curNode=curNode->getNext(); } a=aNode->getItem();   A. 5 B.8 C.0 D.7

Task (C Language) Your task is to modify the scheduler in Project 8 so the jobs with higher priority are added before the jobs with lower priority. You will make the following change to the program: Modify the add_job function such that instead of adding to the end of the linked list, a job is added to an ordered linked list. A new job is added to an ordered linked list by priority. Jobs with higher priority are added before the jobs with lower priority. The list remains ordered by priority after the new job is added. If a new job has the same priority as other jobs, the new job will be added as the last one of the same priority. Example picture attached below