Complete the code in the red column

• string info; int link;

• int info; NodeType link;

• int info; string link;

• int info; NodeType * link;

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

• 34

• 12

• 88

• 3

In Linked List implementation, a node carries information regarding

• Data

• Link

• Data and Link

• None of the mentioned

Which of the following is not the advantages of Array lists?

• Fast random access to the elements

• Easy to use

• Easy to program

• Size is fixed

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 temp -> next -> next-> data below?

• 34

• 88

• 12

• 3

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

• 12

• 4600

• 1600

• 88

struct node *current = start->next

what "current" will contain if it is 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?

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

• Create a new node for a linked list

• Delete a new node from a linked list

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