13/7/2023 - Linked list

In which of the following linked list we can traverse both front and back directions?

• Singly linked list

• Doubly linked list

• Both

In which, the address of the last node points to the head node?

• Circular linked list

• Doubly linked list

• Singly linked list

In any linked list, the individual element is called as -----------

• data

• link

• node

Which of the following statement is not true?

• Insertion and deletion is easier in linked list

• Linked list requires additional memory to store the links

• The size of the linked list is fixed

---------------- returns node X to the storage pool.

• GETNODE(X)

• RET(X)

• INSERT(X)

In doubly linked list each node has -------------- fields

• 2

• 3

• 1

• None of the above

Sparse matrix uses ----------- type of linked list

• Singly

• Doubly

• Circular

• Doubly circular

In sparse matrix linked list representation, the nodes are created only for ---------

• Zero elements

• Non zero elements

• Both Zero and Nonzero elements

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

• We can navigate in both the directions

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

• It requires more space than a singly linked list

How many pointers are required for linked list invert operation?

• 2

• 3

• 1

• 0