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

Here, you will find a collection of MCQ questions on Data Structure and Algorithms (DSA). Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

Q. The given Graph is regular.

  • (A) True
  • (B) False
  • (C) none
  • (D) none

A

Admin • 833.24K Points
Coach

Q. A connected planar graph having 6 vertices, 7 edges contains regions.

  • (A) 15
  • (B) 3
  • (C) 1
  • (D) 11

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

Q. What is the maximum number of edges in a bipartite graph having 10 vertices?

  • (A) 24
  • (B) 21
  • (C) 25
  • (D) 16

A

Admin • 833.24K Points
Coach

Q. Which of the following is true?

  • (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

Admin • 833.24K Points
Coach

Q. For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?

  • (A) v=e
  • (B) v = e+1
  • (C) v + 1 = e
  • (D) v = e-1

A

Admin • 833.24K Points
Coach

Q. For which of the following combinations of the degrees of vertices would the connected graph be eulerian?

  • (A) 1,2,3
  • (B) 2,3,4
  • (C) 2,4,5
  • (D) 1,3,5

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.