Algorithms · Question 23 · Medium
Algorithms question 23
An undirected weighted graph has the edges A-B 4, A-C 1, B-C 2, B-D 5, C-D 8, C-E 10, D-E 2, D-F 6 and E-F 3. What is the total weight of its minimum spanning tree?
- 13
- 12
- 15
- 14
Answer and explanation
Answer: A. 13
Explanation: Kruskal's algorithm picks A-C 1, B-C 2, D-E 2 and E-F 3, skips A-B 4 because it forms a cycle, then adds B-D 5 to join the two components. The total is 1 + 2 + 2 + 3 + 5 = 13.
Previous: Two sorted lists with 6 and 9 elements are merged into one sorted list using… · Next: What is the solution of the recurrence T(n) = T(n - 1) + n, with T(1) = 1?
Practise algorithms
Try a fresh set of algorithms questions with an explanation after every answer, free and without signing up: Algorithms practice. Or sit a full placement mock test.
More algorithms questions
- What is the time complexity of finding the largest element in an unsorted…
- Bubble sort is applied to the array [4, 1, 3, 2] in ascending order. What does…
- Two sorted lists with 6 and 9 elements are merged into one sorted list using…
- What is the solution of the recurrence T(n) = T(n - 1) + n, with T(1) = 1?
- Coins of ₹2, ₹3 and ₹5 are available in unlimited supply. In how many…
- Selection sort (ascending) is applied to [29, 10, 14, 37, 13]. In each pass…
- What is the edit distance (minimum number of single-character insertions…
- Four matrices with dimensions 5×10, 10×3, 3×12 and 12×5 are multiplied as a…
- Lomuto partition with the last element as the pivot is applied once to [7, 2…
- What is the length of the longest strictly increasing subsequence of [3, 10…
More technical & programming practice
Object-Oriented Programming · DBMS · SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge