HW01-sln

HW01-sln - CSE310 HW01 Grading Keys A Please note that you...

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

View Full Document Right Arrow Icon
CSE310 HW01 Grading Keys Please note that you have to typeset your assignment using either L A T E X or Microsoft Word. Hand-written assignment will not be graded. You need to submit a hardcopy before the lecture on the due date. You also need to submit an electronic version at the digital drop box. For the electronic version, you should name your file using the format HWxy-LastName-FirstName. 1. (10 pts) Let f ( n ) = n 3 and g ( n ) = 100 × n × log 2 n . Find the smallest integer N 1 such that f ( N ) g ( N ) but f ( N + 1) > g ( N + 1). Show the values of N , f ( N ), g ( N ), f ( N + 1) and g ( N + 1). Solution: N = 20, f ( N ) = 8000, g ( N ) = 8643 . 86, f ( N + 1) = 9261, g ( N + 1) = 9223 . 87. Grading Keys: 6 pts for N ; 1 pt for each of the other values. 2. (10 pts) For each function f ( n ) (the row index in the following table) and time t (the column index in the following table), determine the largest size n of a problem that can be solved in time t , assuming that the algorithm takes
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.

Page1 / 3

HW01-sln - CSE310 HW01 Grading Keys A Please note that you...

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