The Minimal Spanning Tree Solution Algorithm Works by Defining a Subnetwork

question 20

Multiple Choice

The minimal spanning tree solution algorithm works by defining a subnetwork and

• A) adding the least expensive arc which connects any node in the current subnetwork to any node not in the current subnetwork.
• B) adding the most expensive arc which connects any node in the current subnetwork to any node not in the current subnetwork.
• C) adding the least expensive arc which connects unconnected nodes in the current subnetwork.
• D) adding the least expensive arc which connects the most recently added node in the current subnetwork to the closest node not in the current subnetwork.

---

Definitions:

Sensitivity Training

Programs designed to enhance individuals’ understanding and empathy towards the differences and diversity of others in the workplace.

Team Building

Activities and exercises aimed at enhancing the relationships and efficiency of a team within an organization.

Mentoring

A development relationship where a more experienced individual guides and advises a less experienced person.

Job Rotation

A workplace strategy involving the periodic transfer of employees between different jobs or tasks to broaden their skills and reduce monotony.