Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time?
i) Insertion at the front of the linked list
ii) Insertion at the end of the linked list
iii) Deletion of the front node of the linked list
iv) Deletion of the last node of the linked lis

Related MCQs

• Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the end node of the linked list
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the 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 variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?
• Consider the following definition in c programming language struct node { int data; struct node * next; } typedef struct node NODE; NODE *ptr; Which of the following c code is used to create new node?
• In a linked list, the pointer of the last node contains a special value, called the ______ pointer.
• A ________ linked list is a linked list structure in which each node has a pointer to both its successor and predecessor.
• A variant of linked list in which last node of the list points to the first node of the list is?
• To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
• Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?