Question 3
What is the weight of a minimum spanning tree in the graph given below?
Question 3: What is the weight of a minimum spanning tree in the grap…
Show answer
Correct answer: 10
Question 3 of 16 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 2 paper sat on 23 Nov 2025, in the September 2025 term (IIT M DIPLOMA AN EXAM QDD2 23 Nov 2025 NEW). It carries 3 marks.
More questions from this paper
- In the given graph, if we try to find the shortest path from node P to all other nodes using Dijkstra’s algorithm, whic…
- Consider the following algorithm to solve the single source shortest path problem for a graph (directed or undirected) …
- Let\ be a connected undirected graph with distinct positive edge weights.Consider a partition (cut) of the vertex set\ …
- Consider a max-heap of size\ consisting of distinct elements and implemented using an array. Which of the following ope…
- Consider a max-heap of size\ consisting of distinct elements and implemented using an array.Which of the following stat…
- The height of a binary search tree is defined as the number of nodes in the longest path from the root to the leaf (bot…
- The height of a binary search tree is defined as the number of nodes in the longest path from the root to the leaf (bot…
- What is the minimum number of nodes possible in an AVL tree of height 6 ? Consider the tree with a single node having h…
- After inserting the following elements into an empty AVL Tree:\ 30, 20, 10, 28, 25, 40\ Which of the following nodes wi…
- Given below is a set of characters and their frequencies: Using Huffman encoding, construct the Huffman tree for this s…
- Consider a problem scenario where you have to conduct\ job interviews\ . Each candidate is available only between start…
- In an integer list L of length n, two elements L[i] and L[j] form an inversion if L[i] > L[j] and i \< j. Consider a li…
- Which of the following statements is incorrect?
- Consider the following recursive function to return the minimum element in the list L of size n. def find_min(L, low, h…
- Consider the following recurrences and choose the correct option. 1. 2. Base Case: