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

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. A graph with all vertices having equal degree is known as a

  • (A) Multi Graph
  • (B) Regular Graph
  • (C) Simple Graph
  • (D) Complete Graph

A

Admin • 833.24K Points
Coach

Q. Which of the following ways can be used to represent a 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

Admin • 833.24K Points
Coach

Q. The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is

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

Admin • 833.24K Points
Coach

Q. Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?

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

A

Admin • 833.24K Points
Coach

Q. Number of vertices with odd degrees in a graph having a eulerian walk is

  • (A) 0
  • (B) Can’t be predicted
  • (C) 2
  • (D) either 0 or 2

A

Admin • 833.24K Points
Coach

Q. How many of the following statements are correct?

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

Admin • 833.24K Points
Coach

Q. What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.

  • (A) n-2
  • (B) n
  • (C) 2
  • (D) 0

A

Admin • 833.24K Points
Coach

Q. What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?

  • (A) O(E*E)
  • (B) O(V*V)
  • (C) O(E)
  • (D) O(V)

A

Admin • 833.24K Points
Coach

Q. With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?

  • (A) (V*(V-1))/2
  • (B) (V*(V+1))/2
  • (C) (V+1)C2
  • (D) (V-1)C2

A

Admin • 833.24K Points
Coach

Q. The topological sorting of any DAG can be done in time.

  • (A) cubic
  • (B) quadratic
  • (C) linear
  • (D) logarithmic

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.