Prim’s Algorithm MCQ

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

• Which of the following is false about Prim’s algorithm?
  ক

  It is a greedy algorithm

  খ

  It constructs MST by selecting edges in increasing order of their weights

  গ

  It never accepts cycles in the MST

  ঘ

  It can be implemented using the Fibonacci heap
• Prim’s algorithm can be efficiently implemented using _____ for graphs with greater density.
  ক

  d-ary heap

  খ

  linear search

  গ

  fibonacci heap

  ঘ

  binary search
• Prim’s algorithm is also known as __________
  ক

  Dijkstra–Scholten algorithm

  খ

  Borůvka’s algorithm

  গ

  Floyd–Warshall algorithm

  ঘ

  DJP Algorithm
• Consider the graph shown below. Which of the following edges form the MST of the given graph using Prim’a algorithm, starting from vertex 4.
  ক

  (4-3)(5-3)(2-3)(1-2)

  খ

  (4-3)(3-5)(5-1)(1-2)

  গ

  (4-3)(3-5)(5-2)(1-5)

  ঘ

  (4-3)(3-2)(2-1)(1-5)
• Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.
  ক

  True

  খ

  False
• Prim’s algorithm resembles Dijkstra’s algorithm.
  ক

  True

  খ

  False
• Prim’s algorithm is a ______
  ক

  Divide and conquer algorithm

  খ

  Greedy algorithm

  গ

  Dynamic Programming

  ঘ

  Approximation algorithm
• Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?
  ক

  O(log V)

  খ

  O(V2)

  গ

  O(E2)

  ঘ

  O(V log E)
• Consider the given graph. What is the weight of the minimum spanning tree using the Prim’s algorithm,starting from vertex a?
  ক

  23

  খ

  28

  গ

  27

  ঘ

  11