MCQOPTIONS
Saved Bookmarks
| 1. |
Consider the following statements.S1. Kruskal s algorithm might produce a non-minimal spanning tree. |
| A. | nS2. Kruskal s algorithm can efficiently implemented using the disjoint-set data structure. |
| B. | S1 is true but S2 is false |
| C. | Both S1 and S2 are false |
| D. | Both S1 and S2 are true |
| E. | S2 is true but S1 is false |
| Answer» E. S2 is true but S1 is false | |