Question

Question 10 What is the functionality of the following code? void myFunction() Node* current = head; while(current ! =NULL) { cout << current->value << ""; current = current->next; cout < endl; } Return the element at the given position in the list Inserting a node at the beginning of the list Deleting a node at the beginning of the list Printing all elements in the llst Deleting a node at the end of the llst

Answer 1

10.

In this function, we first initialize a pointer named current to point to the head of a list.
Then we loop till the pointer current points to NULL,
And in each iteration, we print the value at the current node.

According to this information, we gathered we can conclude that this function prints values of all nodes in a linked list.

Hence option 4 is true, function prints all elements in a list.

7.

The function takes an integer parameter that tells what index we have to reach.
We first check if the index is in the range of the list or not, if not we print an error message and if the index is in range,
We take a pointer to point the head of the list,
Then we use a loop to reach to move the current pointer to reach from head to index specified by the user.
Then we return the value at the current position.

Clearly the information tells us that this function takes an index value and returns the value at that index in the list.

Hence option 3 is correct, Function returns the element at a given position in the list.

6.

In this function, we first create a node,
Then we initialize a pointer named current and make it point to head of the list.
Then we use a while loop to reach at the end of the list.
And after that, we put this newly created node at the end.

Clearly the function is used to insert a node at the end.

Hence option 3 is correct. The function is used to insert a node at end of the list.

FOR HELP PLEASE COMMENT.
THANK YOU.