Which of the following operations is performed more efficiently by a doubly linked list than by a linearly linked list?

The operation that is performed more efficiently by a doubly linked list than by a linearly linked list is the deletion of a given node.

Here's why:

1. In a singly linked list (linearly linked list), to delete a node, you need to keep track of the previous node, so you can update its next pointer. This requires traversing the list from the head to the previous node, which takes O(n) time in the worst case.

2. In a doubly linked list, each node has a pointer to both the next node and the previous node. So, if you're given a node to delete, you can simply update the next pointer of the previous node and the previous pointer of the next node. This operation is O(1), i.e., it takes constant time.

Therefore, a doubly linked list performs the deletion of a given node more efficiently than a singly linked list.