MIT1_204S10_assn4_sol

MIT1_204S10_assn4_sol - 1.204 Computer Algorithms in...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1.204 Computer Algorithms in Systems Engineering Spring 2010 Problem Set 4: Satellite data sets Due: 12 noon, Monday March 29, 2010 Please see the code provided for the implementation. There are three separate solutions in the Java zip file. All use identical versions of Merge, SatelliteData and MinHeap. a. Solution with an explicit tree uses MergeMain and TreeNode b. Solution without an explicit tree uses MergeMainNoTree and Node c. Solution used to answer question 3 below uses MergeMainNoTreeAnalysis and Node Analysis questions: 1. In a full binary tree, each node has either zero or two children. In each step of the algorithm, we add two children (which are either nodes or trees) to a node or a tree. In the initial step, we add two nodes to a single node and thus creating a full binary tree. Adding two nodes to a full binary tree also creates another full binary tree. Joining two full binary trees also creates another full binary tree. Thus, at the end of the optimal merge algorithm, we have a full binary tree. 2.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

MIT1_204S10_assn4_sol - 1.204 Computer Algorithms in...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online