This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: ENGRI 1101 Engineering Applications of OR Fall ’09 Homework 3 The Minimum Spanning Tree Problem • Due date: 4:00pm on Wednesday, September 23, 2009 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, NETID, and LAB SECTION 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 1100000100, 1111011011, 1100000000, 1100000011, and 1111101011. Apply the construction given to transform the original DNA data into a valid input for the minimum spanning tree problem. (b) (15 points) Apply Kruskal’s 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
- Fall '09
- Kruskal's algorithm, Spanning tree, Rhodes Hall, Upson