Question
Download Solution PDFGiven the graph below which one of the following edges cannot be added in that order to find a minimum spanning tree algorithm.
A. a - b
B. d - f
C. b - f
D. d - c
E. d - e
Choose the correct answer from the options given below:
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFThe correct answer is B, A, C, E, D
Key PointsIn Kruskal's algorithm, the edges are incorporated in the order of their increasing weights. Nonetheless, in Option 3, edge E bearing a weight of 4 is added prior to edge D with a weight of 2. Therefore, Option 3 is an incorrect representation.
Last updated on Jun 12, 2025
-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.
-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.
-> The exam is conducted bi-annually - in June and December cycles.
-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions.
-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.