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:

Responsibility

The condition or reality of being obligated to manage something or to have authority over an individual.

Decision Making

Decision Making is the cognitive process of selecting a course of action among multiple alternatives.

ERG Theory

A theory of human motivation that categorizes needs into existence, relatedness, and growth, proposing that these needs can be pursued simultaneously.

Performance Ratings

Evaluations or assessments of an employee's job performance over a specific period.