Top 350+ Solved Data Structures (DS) MCQ Questions Answer
Q. Which of the following is true?
a. larger the order of B-tree, less frequently the split occurs
b. larger the order of B-tree, more frequently the split occurs
c. smaller the order of B-tree, more frequently the split occurs
d. smaller the order of B-tree, less frequently the split occurs
Q. In a max-heap, element with the greatest key is always in the which node?
a. Leaf node
b. First node of left sub tree
c. root node
d. First node of right sub tree
Q. What is the complexity of adding an element to the heap.
a. O(log n)
b. O(h)
c. O(log n) & O(h)
d. O(n)
Q. The worst case complexity of deleting any arbitrary node value element from heap is
a. O(logn)
b. O(n)
c. O(nlogn)
d. O(n2)
Q. An array consists of n elements. We want to create a heap using the elements. The time complexityof building a heap will be in order of
a. O(n*n*logn)
b. O(n*logn)
c. O(n*n)
d. O(n *logn *logn)
Q. Which of the following statements for a simple graph is correct?
a. Every path is a trail
b. Every trail is a path
c. Every trail is a path as well as every path is a trail
d. Path and trail have no relation
Q. For the given graph(G), which of the following statements is true?
a. G is a complete graph
b. G is not a connected graph
c. The vertex connectivity of the graph is 2
d. none
Q. What is the number of edges present in a complete graph having n vertices?
a. (n*(n+1))/2
b. (n*(n-1))/2
c. n
d. Information given is insufficient
Q. If a simple graph G, contains n vertices and m edges, the number of edges in the GraphG'(Complement of G) is
a. (n*n-n-2*m)/2
b. (n*n+n+2*m)/2
c. (n*n-n-2*m)/2
d. (n*n-n+2*m)/2
Q. Which of the following properties does a simple graph not hold?
a. Must be connected
b. Must be unweighted
c. Must have no loops or multiple edges
d. Must have no multiple edges
Q. What is the maximum number of edges in a bipartite graph having 10 vertices?
a. 24
b. 21
c. 25
d. 16