Top MCQs on Linked List Data Structure with Answers

A doubly linked list is declared as

struct Node {
       int Value;
       struct Node *Fwd;
       struct Node *Bwd;
);

// Struct definition in C
struct Node {
    int Value;
    struct Node *Fwd;
    struct Node *Bwd;
};

// Struct definition in Java
class Node {
    int Value;
    Node Fwd;
    Node Bwd;
}

# Class definition in Python
class Node:
    def __init__(self, value):
        self.Value = value
        self.Fwd = None
        self.Bwd = None

// Class definition in JavaScript
class Node {
    constructor(value) {
        this.Value = value;
        this.Fwd = null;
        this.Bwd = null;
    }
}

Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segments of code deletes the node pointed to by X from the doubly linked list, if it is assumed that X points to neither the first nor the last node of the list?

A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let n denote the number of nodes in the queue. Let 'enqueue' be implemented by inserting a new node at the head, and 'dequeue' be implemented by deletion of a node from the tail.

Which one of the following is the time complexity of the most time-efficient implementation of 'enqueue' and 'dequeue, respectively, for this data structure?

In a doubly linked list, the number of pointers affected for an insertion operation will be

Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation can not be implemented in O(1) time ?

Consider a single linked list where F and L are pointers to the first and last elements respectively of the linked list. The time for performing which of the given operations depends on the length of the linked list?

F->1->2->3->L

The following steps in a linked list

p = getnode()
 info (p) = 10
 next (p) = list
 list = p

result in which type of operation?

In DNA sequence alignment, which string-matching algorithm is commonly used to identify similarities between two DNA sequences efficiently?

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

The time required to search an element in a linked list of length n is

The minimum number of fields with each node of doubly linked list is