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:

Interest Expense

The cost incurred by an entity for borrowed funds, which can be a bank loan, bond, mortgage, or other forms of debt financing.

Discounted Bond

A bond sold for less than its face value due to prevailing interest rates being higher than the bond's coupon rate.

Amortized

The process of gradually writing off the initial cost of an asset over a period of time or spreading out a loan payment.

Discount on Bonds Payable

The difference between the bonds' par (or face) value and their lower selling price, representing additional interest expense to the issuer over the term of the bonds.