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

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. A graph is said to be complete if there is no edge between every pair of vertices.

  • (A) true, false, true
  • (B) true, true, false
  • (C) true, true, true
  • (D) false, true, true

A

Admin • 833.24K Points
Coach

Q. The time complexity of binary search is O(logn).

  • (A) true, false
  • (B) false, true
  • (C) false, false
  • (D) true, true

A

Admin • 833.24K Points
Coach

Q. A graph is said to be complete if there is an edge between every pair of vertices.

  • (A) true, true
  • (B) false, true
  • (C) false, false
  • (D) true, false

A

Admin • 833.24K Points
Coach

Q. To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

  • (A) i-only
  • (B) ii-only
  • (C) both i and ii
  • (D) none of both

A

Admin • 833.24K Points
Coach

Q. Nodes that are not root and not leaf are called as internal nodes.

  • (A) true, true
  • (B) true, false
  • (C) false, true
  • (D) false, false

A

Admin • 833.24K Points
Coach

Q. A node is child node if out degree is one.

  • (A) true, true
  • (B) true, false
  • (C) false, true
  • (D) false, false

A

Admin • 833.24K Points
Coach

Q. In strictly binary tree, the out-degree of every node is either o or 2.

  • (A) true, false
  • (B) false, true
  • (C) true, true
  • (D) false, false

A

Admin • 833.24K Points
Coach

Q. The complexity of the average case of an algorithm is

  • (A) much more complicated to analyze than that of worst case
  • (B) much more simpler to analyze than that of worst case
  • (C) sometimes more complicated and some other times simpler than that of worst case
  • (D) none or above

A

Admin • 833.24K Points
Coach

Q. The Average case occur in linear search algorithm

  • (A) when item is somewhere in the middle of the array
  • (B) when item is not in the array at all
  • (C) when item is the last element in the array
  • (D) when item is the last element in the array or is not there at all

A

Admin • 833.24K Points
Coach

Q. Which of the following case does not exist in complexity theory

  • (A) best case
  • (B) worst case
  • (C) average case
  • (D) null case

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.