The question(s) that follow refer to the problem of finding the minimum spanning tree for the weighted network shown below.
Using Kruskal's algorithm, which edge should we choose third?

A. CD
B. AC
C. BD
D. AB
E. none of these

Answer: C

Mathematics

You might also like to view...

Solve the problem.If a person puts 1¢ in a piggy bank on the first day, 2¢ on the second day, 3¢ on the third day, and so forth, how much money will be in the bank after 30 days?

A. $4.65 B. $9.30 C. $0.30 D. $2.33

View
Mathematics

Write out the first five terms of the sequence.{sn} = {n - 1}

A. s1= 1, s2= 2, s3= 3, s4= 4, s5= 5 B. s1= 0, s2 = 1, s3 = 2, s4 = 3, s5 = 4 C. s1= -1, s2= 0, s3= 1, s4= 2, s5= 3 D. s1= -4, s2= -3, s3= -2, s4= -1, s5= 0

View
Mathematics

Perform the indicated computation. Write the answer in scientific notation.

A. 3.12 × 107 B. 6.24 × 107 C. 6.24 × 10-9 D. 3.12 × 10-9

View
Mathematics

Evaluate f(-2), f(-1), f(0), f(1), and f(5) for the piecewise-defined function.

View
Mathematics