Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 11 - Section 11.5 - Minimum Spanning Trees - Supplementary Exercises - Page 807: 39

Answer

a) (exact coding depends on how ties were broken, but all versions are equivalent); 0.645n for string of length n b) exact coding depends on how ties were broken, but all versions are equivalent); 0.5326n for string of length n

Work Step by Step

a) 0 for 00, -11 for 01, - 100 for 10, -101 for 11 (exact coding depends on how ties were broken, but all versions are equivalent); 0.645n for string of length n b) -0 for 000, - 100 for 001, - 101 for 010, - 110 for 100, - 11100 for 011, - 11101 for 101, - 11110 for 110, - 11111 for 111 (exact coding depends on how ties were broken, but all versions are equivalent); 0.5326n for string of length n
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.