Linked List (Chapter 2)

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

What will be printed when Head->next->data are executes as in the above image?

• 83

• 9

• 27

• Error

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

Which the following double linked list

• 
• 
• 
• 

How many fields the doubly linked list would have in a node?

• 1

• 2

• 3

• 4

What differentiates a circular linked list from a normal linked list?

• You cannot have the ‘next’ pointer point to null in a circular linked list

• It is faster to traverse the circular linked list

• You may or may not have the ‘next’ pointer point to null in a circular linked list

• Head node is known in circular linked list

In a circular linked list ----------------

• Components are all linked together in some sequential manner

• There is no beginning and no end.

• Components are arranged hierarchically.

• Forward and backward traversal within the list is permitted.

Which of the following is false about a doubly linked list?

• We can navigate in both the directions

• It requires more space than a singly linked list

• The insertion and deletion of a node take a bit longer

• Implementing a doubly linked list is easier than singly linked list

The last node of the singly-linked list contains__________.

• INFO

• NULL

• NEXT

• None of the above