This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Assignment #1 CS4/531 Due Date: Mon. Sep. 19, 2011 UNSUPPORTED SOLUTIONS RECEIVE NO CREDIT. Total points: 55 You MUST turn in your HW by 2:10pm on Sep 19. After that, I will NOT accept your HW. This rule will be STRICTLY ENFORCED. Please PRINT YOUR LAST NAME, FIRST NAME and UB number on the first page. Write solution of each problem on a separate sheet. Staple them in the order of problem numbers. If your homework solution deviates significantly from these guidelines, TA may deduct up to 20% of the points. 1. (4 pts) We want to prove the function f ( n ) = 3 n 2 + 4 n- 20 = ( n 2 ) by using the definition of . Namely we need to find c > 0 and n 0 such that: 3 n 2 + 4 n- 20 cn 2 for all n n There are many combinations of c and n that will satisfy the definition. Try the following values for c . 1. Pick c = 2, determine the smallest n that satisfies the definition....
View Full Document
- Fall '09