Top 350+ Solved Data Structure and Algorithms (DSA) MCQ Questions Answer
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
Q. Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.
a. a-iii, b-ii, c-i
b. a-i, b-ii, c-iii
c. a-iii, b-i, c-ii
d. a-i, b-iii, c-ii
Q. The time complexity of binary search is O(logn).
a. true, false
b. false, true
c. false, false
d. true, true
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
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
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
Q. A node is child node if out degree is one.
a. true, true
b. true, false
c. false, true
d. false, false
Q. Insertion b) Deletion c) Retrieval d) Traversal
a. only a,b and c
b. only a and b
c. all of the above
d. none of the above
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
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
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
Q. Which of the following case does not exist in complexity theory
a. best case
b. worst case
c. average case
d. null case
Q. The space factor when determining the efficiency of algorithm is measured by
a. counting the maximum memory needed by the algorithm
b. counting the minimum memory needed by the algorithm
c. counting the average memory needed by the algorithm
d. counting the maximum disk space needed by the algorithm
Q. The time factor when determining the efficiency of algorithm is measured by
a. counting microseconds
b. counting the number of key operations
c. counting the number of statements
d. counting the kilobytes of algorithm