The _________ for a linked list is a pointer variable that locates the beginning of the list.

Related MCQs

• Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
• What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• How do you calculate the pointer difference in a memory efficient double linked list?
• if there are no nodes in linked list then start pointer will point at which value?
• In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
• A _____________ list is a list where the last node contains null pointer.
• The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
• A linked list whose last node points back to the list node instead of containing the null pointer________.
• In ……………, search start at the beginning of the list and check every element in the list.