Linked List and Arrays in JAVA

Which is the correct code to acess the second node in a linked list?

• head.getData()

• head.getNext().getData()

• head.getNext().getNext().getData()

• none of the above

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

The doubly linked list would have how many fields in a node?

• 1

• 2

• 3

• 4

How many null pointers exists in a circular linked list?

• 0

• 1

• 2

• 3

Each node in a linked list has two

pairs of ………….. and ……………….

• Link field and information field

• Link field and avail field

• Avail field and information field

• Address field and link field

What is the condition to check whether linked

list is empty

• Head->next==Null

• Head->next->next==Null

• temp->next==Null

• Head==Null

Which of these is a self-referential structure?

• Linked-List

• Array

• Node

• None of the above

What would the next of the last node of a circular linked list return?

• head

• tail

• null

• none of the above