This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ENGRI 1101 Engineering Applications of OR Fall 2008 Homework 3 The Minimum Spanning Tree Problem Due date: 4:00pm on Friday, September 19, 2008 in the ENGRI 1101 box at the west end of the corridor on the second floor of Rhodes Hall, where it connects to Upson. Reading assignment: Handout 4 on the minimum spanning tree problem. Make sure to put your name on the first page and staple the problems in order. 1. (55 points) Consider the DNA storage problem described in Handout 4: (a) (15 points) Suppose that the input to the DNA problem is 0000000101, 1100111111, 1100111110, 0000001001, and 0000111111. Apply the construction given to transform the original DNA data into a valid input for the minimum spanning tree problem. (b) (15 points) Apply Kruskals algorithm to find a minimum spanning tree. Be sure to show your work, so that it is possible to see that you are executing the algorithm correctly....
View Full Document
This note was uploaded on 09/30/2008 for the course ENGRI 1101 taught by Professor Trotter during the Fall '05 term at Cornell University (Engineering School).
- Fall '05