Top 350+ Solved Data Structures (DS) MCQ Questions Answer

a. A graph may contain no edges and many vertices

b. A graph may contain many edges and no vertices

c. A graph may contain no edges and no vertices

d. A graph may contain no vertices and many edges

a. v=e

b. v = e+1

c. v + 1 = e

d. v = e-1

a. 1,2,3

b. 2,3,4

c. 2,4,5

d. 1,3,5

a. Multi Graph

b. Regular Graph

c. Simple Graph

d. Complete Graph

a. Adjacency List and Adjacency Matrix

b. Incidence Matrix

c. Adjacency List, Adjacency Matrix as well as Incidence Matrix

d. No way to represent

a. 2((n*(n-1))/2)

b. 2((n*(n+1))/2)

c. 2((n-1)*(n-1))/2)

d. 2((n*n)/2)

a. 1

b. 2

c. 3

d. 4

a. 0

b. Can’t be predicted

c. 2

d. either 0 or 2

a. All cyclic graphs are complete graphs.

b. All complete graphs are cyclic graphs.

c. All paths are bipartite.

d. All cyclic graphs are bipartite.

a. Depends on a Graph

b. Will always be zero

c. Will always be greater than zero

d. May be zero or greater than zero

a. When the list has only a few elements

b. When performing a single search in an unordered list

c. Used all the time

d. When the list has only a few elements and When performing a single search in an unordered list

a. O(nlogn)

b. O(logn)

c. O(n)

d. O(1)

a. O(nlogn)

b. O(logn)

c. O(n)

d. O(1)

a. O(nlogn), O(logn)

b. O(logn), O(nlogn)

c. O(n), O(1)

d. O(1), O(n)

a. Requires more space

b. Greater time complexities compared to other searching algorithms

c. Not easy to understand

d. Not easy to implement