Linked List Quiz (BSIS 2-B)

Describe linked list.

• It is a linear collection of data elements with fix size.

• It is a linear collection of data elements with known size.

• It is a linear collection of data elements with dynamic size.

• It is a linear collection of data elements with static size.

What is node?

• A node contains one or more data fields that point to the succeeding node.

• A node contains only one data field that point to the next node.

• A node always contains more than two data fields that point to the last node.

• A node contains one or more data fields that always point to the head.

All statements are true about NULL except:

• The NULL node is used to represent the end of the linked list.

• If head is NULL, the linked list is empty.

• The NULL node is used to represent the start of the linked list.

• If head.next is NULL, the linked list has a single node.

What is dynamic memory allocation?

• Process of allocating memory during program creation.

• Process of allocating memory to the variables during runtime.

• Process of allocating memory during program compilation.

• Process of allocating memory to the variables during program creation.

All statements are true about singly linked list except:

• The simplest type of linked list.

• The node contains information/data and only one node which points to the next node in the linked list.

• The traversal of data elements can be done only in one way going forward.

• The traversal of data elements can be done only in one way going backward.

Traversing a linked list means ___________.

• accessing all the odd nodes of the linked list exactly once.

• accessing all the even nodes of the linked list more than once.

• accessing all the nodes of the linked list exactly once.

• accessing all the nodes of the linked list more than once.

Traversing a linked list means ___________.

• accessing all the odd nodes of the linked list exactly once.

• accessing all the even nodes of the linked list more than once.

• accessing all the nodes of the linked list exactly once.

• accessing all the nodes of the linked list more than once.

Searching for a value in a linked list means __________.

• to find an unknown element/value in the linked list.

• to find a particular value or element in the linked list.

• to find an unknown element/value at the beginning of the linked list.

• to find a particular element/value at the beginning of the linked list.

Which of the following statements is not true about node insertion?

• A new node is inserted at the beginning of the linked list.

• A new node is inserted at the end of the linked list.

• A new node is inserted in a linked list when a node is removed.

• A new node is inserted after the given node in a linked list.

All statements are true in inserting the node at the beginning of the linked list except:

• First check the overflow condition.

• If the memory is not available, then an overflow message is displayed.

• If the memory is available, then an overflow message is displayed

• If the memory is available, then memory is allocated for the new node.