Directed Graph MCQ

Test your knowledge with important Directed Graph MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Directed Graph MCQs at Bissoy

• What is the maximum number of edges present in a simple directed graph with 7 vertices if there exists no cycles in the graph?
  ক

  21

  খ

  7

  গ

  6

  ঘ

  49
• What would be the DFS traversal of the given Graph?
  ক

  ABCED

  খ

  AEDCB

  গ

  EDCBA

  ঘ

  ADECB
• What is the maximum possible number of edges in a directed graph with no self loops having 8 vertices?
  ক

  28

  খ

  64

  গ

  256

  ঘ

  56
• Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices u and v will never change?
  ক

  add all values by 10

  খ

  subtract 10 from all the values

  গ

  multiply all values by 10

  ঘ

  in both the cases of multiplying and adding by 10
• All Graphs have unique representation on paper.
  ক

  True

  খ

  False
• Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of __________
  ক

  O(V*V)

  খ

  O(V*V*V)

  গ

  O(E*V)

  ঘ

  O(E*E)
• What is the number of unlabeled simple directed graph that can be made with 1 or 2 vertices?
  ক

  2

  খ

  4

  গ

  5

  ঘ

  9
• A graph having an edge from each vertex to every other vertex is called a ___________
  ক

  Tightly Connected

  খ

  Strongly Connected

  গ

  Weakly Connected

  ঘ

  Loosely Connected
• Dijkstra’s Algorithm will work for both negative and positive weights?
  ক

  True

  খ

  False