Q66 — Algorithms

Algorithms

Q66. Marks: +2.0 UGC NET Paper 2: Computer Science 11 March 2023

Given 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:

1.A, B, C, D, E

2.A, B, D,C, E

3.B, A, C, E, D ✓ Correct

4.B, A, D, C, E

← Previous 4 / 5 in this subject • Back to paper Next →

🏷 Change Tag for this Question ▶