What advantage does a linked list have over an array?

• Size of the list doesn't need to be mentioned at the beginning of the program

• You can add or remove elements from the middle of the list.

• The linked list doesn't have a size limit

• All of these are true.

Nodes in a linked list contain two things

• Direction and a pointer

• Data and a pointer

• A Pointer and a reference

• A pointer and a node

The situation when in a linked list Head==NULL

is

• Full

• Empty

• Half full

• saturated

In the above image what will be printed when Head->next->data?

• 83

• 9

• 27

• Error

Complete the code in the red column

• string info; int link;

• int info; NodeType link;

• int info; string link;

• int info; NodeType * link;

Which of the following statement is not correct?

• List is a linear structure

• There are 2 example of list, Array List & Linked List.

• Array List is not an example of List

• List contains a sequence of elements

What is value in the head -> next -> next below?

• 12

• 4600

• 1600

• 88

struct node *current = start->next

what will "current" contain if it is a pointer to a variable of type struct node ?

• Address of 2nd Node

• Data Field of 2nd Node

• Address of 1st Node

• None of these

What is the operation of the below statements?

• Insert a new node to the front of a linked list

• Create a new node for a linked list

• Insert a new node to the end of the linked list

• Calculate the size of a linked list

What is the operation of the below statements?

• Create a new node for a linked list

• Insert a new node to the front of a linked list

• Delete a new node from a linked list

• Insert a new node to the end of the linked list