Linked list(3)

In Linked list implementation, a node carries information regarding _______.

• Link

• Data

• Link and Data

• None of the above

A linked list in which the last node of Linked list points to the first is called a _________.

• Singly linked list

• Doubly linked list

• Circular linked list

• None of these

A doubly linked list performs traversal in _________.

• Either direction

• Circular direction

• Any direction

• None of these

Linked list data structure usage offers considerable saving in

• Space utilisation and computational time

• Space utilisation

• computational time

Which of the following operation is performed more efficiently in doubly linked list ?

• Searching an element

• Deleting an element

• Inserting an element

• None of these

If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?

• 1038

• 1036

• 1024

• None of these

In Circular Linked List insertion of a node involves the modification of ____ links.

• 1

• 2

• 3

• 0

The link field in the last node of the singly linked list contains _________.

• Link to the first node

• Zero value

• Pointer to the next element location

• None of the above

When new element is added in the middle of singly linked list then ________.

• Only elements that appear after the new element need to be moved

• Only elements that appear before the new element need to be moved

• No need to move element

• Only elements that appear after the new element and before need to be moved

If a list contains no elements it is said to be

• Hollow

• Empty

• Finite

• Infinite