Linked List Data Structure MCQs

Concept of circular linked list is ______.

(a) Components are all linked together in some sequential manner.
(b) There is no beginning and no end.
(c) Components are arranged hierarchically.
(d) Forward and backward traversal within the list is permitted.


(b) There is no beginning and no end.

A linear collection of data elements where the linear nodes are connected with each other is called as ____.

(a) Linked list
(b) Node list
(c) Primitive list
(d) None


(a) Linked list

In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

(a) Pointer to character
(b) Pointer to integer
(c) Pointer to node
(d) Node


(c) Pointer to node

Traversing in Doubly linked lists can be performed in which manner?

(a) Only in forward direction
(b) Only in reverse direction
(c) In both directions
(d) None


(c) In both directions

A variant of the linked list in which none of the node contains NULL pointer is

(a) Singly linked list
(b) Doubly linked list
(c) Circular linked list
(d) None


(c) Circular linked list

Linked lists are not suitable to for the implementation of?

(a) Insertion sort
(b) Radix sort
(c) Polynomial manipulation
(d) Binary search


(d) Binary search

In worst case, the number of comparison need to search a singly linked list of length n for a given element is

(a) log n
(b) n/2
(c) log2n-1
(d) n


(d) n

Linked list is generally considered as an example of _____ allocation. *

(a) Static
(b) Dynamic
(c) Constant
(d) All of these


(b) Dynamic

Which of these is an application of linked lists?*

(a) To implement file systems
(b) For separate chaining in hash-tables
(c) To implement non-binary trees
(d) All of the mentioned


(d) All of the mentioned

In circular linked list, insertion of node requires modification of?

(a) One pointer
(b) Two pointer
(c) Three pointer
(d) None


(b) Two pointer

Collection of linear nodes by means of pointers is called as _____.

(a) Heap
(b) Stack
(c) Pointer
(d) Linked List


(d) Linked List

Which of the following points is/are true about Linked List data structure when it is compared with array

(a) It is easy to insert and delete elements in Linked List
(b) Random access is not allowed in a typical implementation of Linked Lists
(c) The size of array has to be pre-decided, linked lists can change their size any time
(d) All Of The Above


(d) All Of The Above

Which of the following operations is performed more efficiently by doubly circular 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


(a) Deleting a node whose location in given

What is the time complexity Of inserting at the end in dynamic arrays?

(a) O(1)
(b) O(n)
(c) O(logn)
(d) Either O(1) or O(n)


(d) Either O(1) or O(n)

linked list data structure offers considerable saving in _____.

(a) Computational Time
(b) Space Utilization
(c) Space Utilization and Computational Time
(d) None of the mentioned


(c) Space Utilization and Computational Time

linked list is considered as an example of ___________ type of memory allocation.

(a) Dynamic
(b) Compile time
(c) none of these
(d) static


(a) Dynamic

what is the time complexity to count the number of elements in the linked list?

(a) O(1)
(b) O(n)
(c) O(logn)
(d) O(n2)


(b) O(n)

what differentiates a circular linked list from a normal linked list?

(a) You cannot have the ‘next’ pointer point to null in a circular linked list
(b) It is faster to traverse the circular linked list
(c) You may or may not have the ‘next’ pointer point to null in a circular linked list
(d) All of the mentioned


(c) You may or may not have the ‘next’ pointer point to null in a circular linked list

what does the following function do for a given linked list with first node as head?

void fun1(struct node* head)
{
  if(head == NULL)
    return;
  
  fun1(head-<next);
  printf("%d  ", head->data);
}

(a) Prints all nodes of linked lists
(b) Prints all nodes of linked list in reverse order
(c) Prints alternate nodes of Linked List
(d) Prints alternate nodes in reverse order


(b) Prints all nodes of linked list in reverse order

which of the following is false about a doubly linked list?

(a) We can navigate in both the directions
(b) It requires more space than a singly linked list
(c) The insertion and deletion of a node take a bit longer
(d) None of the mentioned


(d) None of the mentioned

what is the space complexity for deleting a linked list?

(a) O(1)
(b) O(n)
(c) Either O(1) or O(n)
(d) O(logn)


(a) O(1)

what would be the asymptotic time complexity to find an element in the linked list?

(a) O(1)
(b) O(n)
(c) (n2)
(d) O(n4)


(b) O(n)

In doubly linked lists, traversal can be performed?

(a) only in reverse direction
(b) In both directions
(c) none
(d) forward directions


(b) In both directions

what kind of linked list is best to answer question like what is the item at position n?

(a) Array implementation of linked list
(b) Circular linked list
(c) Doubly linked list
(d) Singly linked list


(a) Array implementation of linked list

In linked list implementation of a queue, where does a new element be inserted?

(a) At the head of link list
(b) At the centre position in the link list
(c) At the tail of the link list
(d) None of the mentioned


(c) At the tail of the link list

Related Topics

"Linked List Data Structure MCQs","Linked List Multiple Choice Questions","Data Structure Multiple Choice Questions & Answers,Linked List Data Structure","MCQs on Linked list with answers","