CSC375 Homework4 George Corser 2009-02-01

CSC375 Homework4 George Corser 2009-02-01 - CSC 375...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: CSC 375 Homework4 George Corser 2009 February 2 Note: For this homework, all constants (c, k) are positive and n is always a positive integer. 3.4 The table below shows the increase in problem size that can be run in a fixed period of time on a computer that is 64 times faster. Problem T(n) n n’ Change n’/n 3.4(a) 3x2 n 10 16 n΄=n+6 none 3.4(b) n 2 10 80 n΄=8n 8.00 3.4(c) n 10 640 n΄=64n 64.00 3.4(a) T(n’) ÷ (computer speedup) = T(n) (3x2 n’ ) ÷ 64 = 3x2 n (2 n’ ) ÷ 64 = 2 n (2 n’ ) = 64x2 n log(2 n’ ) = log(64 x2 n ) n’ = log(64)+n n’ = n + 6 We could process 6 more inputs in T seconds 3.4(b) T(n’) ÷ (computer speedup) = T(n) (n’) 2 ÷ 64 = n 2 (n’) 2 = 64n 2 n’ = 64 n n’ = 8n We could process 8 times more inputs in T seconds 3.4(b) T(n’) ÷ (computer speedup) = T(n) (n’) ÷ 64 = n n’ = 64n We could process 64 times more inputs in T seconds 3.8 3.8(a) c 1 n In the average case T(n) = (c 1 n)/2. For all positive values of n, (c 1 n)/2 ≤ c 1 n, so by the...
View Full Document

This note was uploaded on 01/19/2010 for the course CSC 375 taught by Professor Turner during the Winter '09 term at University of Michigan-Dearborn.

Page1 / 3

CSC375 Homework4 George Corser 2009-02-01 - CSC 375...

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