Q. A graph is said to be complete if there is no edge between every pair of vertices.
✅ Correct Answer: (B)
true, true, false
Data Structure and Algorithms (DSA) MCQs | 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.
Q. The time complexity of binary search is O(logn).
✅ Correct Answer: (D)
true, true
Q. A graph is said to be complete if there is an edge between every pair of vertices.
✅ Correct Answer: (A)
true, true
Q. To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
✅ Correct Answer: (C)
both i and ii
Q. Nodes that are not root and not leaf are called as internal nodes.
✅ Correct Answer: (C)
false, true
Q. A node is child node if out degree is one.
✅ Correct Answer: (B)
true, false
Q. In strictly binary tree, the out-degree of every node is either o or 2.
✅ Correct Answer: (C)
true, true
Q. The complexity of the average case of an algorithm is
✅ Correct Answer: (A)
much more complicated to analyze than that of worst case
Q. The Average case occur in linear search algorithm
✅ Correct Answer: (A)
when item is somewhere in the middle of the array
Q. Which of the following case does not exist in complexity theory
✅ Correct Answer: (D)
null case
Jump to