ps8 math 302

ps8 math 302 - f ( n ) where f ( n ) satisfies the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
MATH 302 Discrete Mathematics Assignment 8. Due on Wednesday, November 3, 2010. Read : Sections 7.3, 5.1, 5.3. Definition : Write down the definitions for the following terms. [5 points] The product rule The sum rule r-permutation r-combination Problems to be graded : [8 points] § 7.3/ 12, 13, 21, 22, § 5.1/ 10, 16, 20, 24 Please also do these . (2 points) Use the Master Theorem to give an asymptotic bound for the sequence
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: f ( n ) where f ( n ) satisfies the following recurrences: 1. f ( n ) = 4 f ( n/ 2) + n 2. f ( n ) = 4 f ( n/ 2) + n 2 . 3. f ( n ) = f (9 n/ 10) + n 4. f ( n ) = 7 f ( n/ 3) + n 2 log n . Other problems : § 7.1/ 11, 14, 19, 23, 44 § 7.2/ 13, 19, 21, 22 § 5.1/ 5, 8,9, 22, 26, 27, 28, 29, 33, 34, 35...
View Full Document

This note was uploaded on 02/13/2012 for the course MATH 302 taught by Professor Staff during the Spring '08 term at Texas A&M.

Ask a homework question - tutors are online