Data Structure and Algorithms (DSA) MCQs with answers Page - 21

Here, you will find a collection of MCQ questions on Data Structure and Algorithms (DSA). Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 833.24K Points
Coach

Q. NULL link is not present in…

  • (A) singly linked list
  • (B) doubly linked list
  • (C) circular linked list
  • (D) none of these

A

Admin • 833.24K Points
Coach

Q. In a circular linked list

  • (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.

A

Admin • 833.24K Points
Coach

Q. A linear collection of data elements where the linear node is given by means of pointer is called?

  • (A) linked list
  • (B) node list
  • (C) primitive list
  • (D) none

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

Q. 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) i and ii
  • (B) i and iii
  • (C) i,ii and iii
  • (D) i,ii and iv

A

Admin • 833.24K Points
Coach

Q. 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

  • (A) i and ii
  • (B) i and iii
  • (C) i,ii and iii
  • (D) i,ii and iv

A

Admin • 833.24K Points
Coach

Q. 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

  • (A) i and ii
  • (B) i and iii
  • (C) i,ii and iii
  • (D) i,ii,iii and iv

A

Admin • 833.24K Points
Coach

Q. 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

A

Admin • 833.24K Points
Coach

Q. 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) o(1)
  • (B) o(n)
  • (C) θ (n)
  • (D) θ (1)

A

Admin • 833.24K Points
Coach

Q. What would be the asymptotic time complexity to add an element in the linked list?

  • (A) o(1)
  • (B) o(n)
  • (C) o(n2)
  • (D) none

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.