Quiz Space

Programming, Data Structures and Algorithms using Python · End Term · 10 May 2026 · January 2026 term · Set 1

Question 22: Consider the graph G given below. Let Minimum Spanning T…

Question 22

+4 marksOne or more correct options

Consider the graph G given below.

Let Minimum Spanning Trees (MSTs) of the graph be constructed using algorithms such as Kruskal’s or Prim’s algorithm.
Which of the following statements are correct?

Select all that apply.

  1. A

    The total weight of MST is 12

  2. B

    The number of distinct MSTs in the graph is 2

  3. C

    The edge (d, f) will be part of every MST

  4. D

    The edge (b, c) will be part of every MST

  5. E

    The edge (b, d) will be part of every MST

Show answer

Correct answers

  • A

    The total weight of MST is 12

  • B

    The number of distinct MSTs in the graph is 2

  • C

    The edge (d, f) will be part of every MST

See the whole paperTake it as a mock test

Question 22 of 24 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 10 May 2026, in the January 2026 term (Programming, Data Structures And Algorithms Using Python 10 May 26). It carries 4 marks.

More questions from this paper

  1. Q1Consider the following function: The function is called as: How many recursive calls will be made by the function exclu…
  2. Q2In a binary tree, suppose there are: 14 nodes with two children, and• 6 nodes with exactly one child.• How many leaf no…
  3. Q3While inserting the elements 50, 80, 20, 60, 10, 45, 65, 30, and 90 into an empty binary search tree (BST) in the seque…
  4. Q4How many bits will be used to encode the message ABCDE using Huffman codes?
  5. Q5Figure question
  6. Q6Figure question
  7. Q7Figure question
  8. Q8Figure question
  9. Q9Figure question
  10. Q10Figure question
  11. Q11Run DFS starting from vertex A. If multiple adjacent vertices exist, they are visited in alphabetical order.\ Which of …
  12. Q12Figure question
  13. Q13Figure question
  14. Q14You are given the following list of 8 meeting requests with start time, and end time.
  15. Q15Figure question
  16. Q16Figure question
  17. Q17Figure question
  18. Q18Which of the following could be possible insertion orders that produce the above hash table?
  19. Q19A data science bootcamp offers 6 learning modules. Students must complete modules according to the prerequisite structu…
  20. Q20Consider the following graph. Suppose Dijkstra’s algorithm is executed with vertex 0 as the source vertex.\ Which of th…
  21. Q21Which of the following is/are always true about the Floyd-Warshall algorithm?
  22. Q23Let C be a problem that belongs to the class NP. Which of the following statement(s) is/are TRUE?
  23. Q24Figure question