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

Dear candidates you will find MCQ questions of Data Structure and Algorithms (DSA) here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
Share your questions by clicking Add Question

A

Admin • 617.67K 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 • 617.67K 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 • 617.67K 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 • 617.67K 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 • 617.67K 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 • 617.67K 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 • 617.67K 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 • 617.67K 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 • 617.67K 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 • 617.67K 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

Browse Categories

Click on category to learn MCQs of that category.