404_HW2_F11 - UML CS Analysis of Algorithms 91.404(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.404 (section 201) Fall, 2011 1 of 2 Homework Set #2 Assigned : Wednesday, 9/14 Due: Wednesday , 9/21 (start of lecture) This assignment covers textbook material in Chapters1-3. Note: Refer to course web site for homework policies. Remember to attach signed honor statement. 1. (28 points) Function Order of Growth List the 4 functions below in nondecreasing asymptotic order of growth: () ( ) n n n n - n n lg lg 3 1 lg 3 2 - 2 2 1) 2) 3) 4) smallest largest Justify your answer. 2 . (28 points) Θ Ω , , O Notation Practice Given (for large n ): ( ) ( ) 3 ) ( 4) 3 1 ) ( 3) lg lg ) ( 2) lg ) ( 1) 2 4 3 2 2 2 1 n -n n f n f n n O n f n n n f Θ Ω Θ a) (7 points) Draw the arrow diagram associated with the 4 statements above.
Background image of page 1

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

View Full Document Right Arrow Icon
UML CS Analysis of Algorithms 91.404 (section 201) Fall, 2011 2 of 2 For each statement below, circle TRUE if the statement must always be true (given what we know about ) ( ), ( ), ( ), ( 4 3 2 1 n f n f n f n f ) and FALSE otherwise. Briefly justify your answer: - for the TRUE case, prove the statement by invoking the properties that apply;
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 2

404_HW2_F11 - UML CS Analysis of Algorithms 91.404(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