503_HW2_S11 - UML CS Analysis of Algorithms 91.503 (section...

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

View Full Document Right Arrow Icon
UML CS Analysis of Algorithms 91.503 (section 201) Spring, 2011 1 of 2 Homework Set #2 Assigned: Tuesday, 2/1 Due: Friday, 2/11 (5:30 pm ) This assignment covers textbook material in Chapter 16 (Greedy Algorithms). Attach signed honor statement. 1. (15 points) Find a maximum-size set of mutually compatible activities for the following set of activities: i 1 2 3 4 5 6 7 8 9 s i 1 11 6 8 3 2 4 12 5 f i 7 12 16 9 12 5 9 16 6 2. (15 points) Find an optimal Huffman code for the following set of frequencies: a : 34 b : 6 c : 89 d : 11 e : 72 f : 45 g : 24 3 . (70 points) This problem, which has an application in bioinformatics, involves a sequence S of n distinct integers. We have the following definitions: Definition 1 : An increasing subsequence of S is a subsequence of S whose values strictly increase from left to right. Definition 2 : A decreasing subsequence of S is a subsequence of S whose values are nonincreasing from left to right. (Note the lack of symmetry in Definitions 1 and 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.

This note was uploaded on 02/13/2012 for the course CS 91.503 taught by Professor Staff during the Spring '11 term at UMass Lowell.

Page1 / 2

503_HW2_S11 - UML CS Analysis of Algorithms 91.503 (section...

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