[Solved] Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?

Q.	Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?
A.	deleting a node whose location in given
B.	searching of an unsorted list for a given item
C.	inverting a node after the node with given location
D.	traversing a list to process each node
Answer» A. deleting a node whose location in given

585

Do you find this helpful?

View all MCQs in

Data Structure and Algorithms (DSA)

Discussion

No comments yet

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
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
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?
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?
In doubly linked lists, traversal can be performed?
In worst case, the number of comparison need to search a singly linked list of length n for a given element is
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 is a linked list structure in which each node has a pointer to both its successor and predecessor.