What among the following is the Kruskal's algorithm an example of?
a. Greedy algorithm
b. Dynamic programming
c. Brute-force algorithm
d. Divide and conquer
a. Greedy algorithm
Kruskal's algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest. It is a greedy algorithm.
You might also like to view...
The basic generic functional interface ________ in package java.util.function contains method get that takes no arguments and returns a value of type T.
a. UnaryOperator
When might it be advantageous to use narration in a presentation?
What will be an ideal response?
Unless changed, Word automatically checks your spelling as you type
Indicate whether the statement is true or false
Visit SCR's data library to review SCR's network configuration and then send Jesse a recommendation for the TIMS system architecture. She wants me to suggest an overall client/server design, number of tiers, and network topology. She also asked me to comment on these issues: legacy data, Web-centricity, scalability, security, and batch processing that might be needed. Jesse said it was OK to make reasonable assumptions in my proposal to her.
What will be an ideal response?