This preview shows pages 1–2. Sign up to view the full content.
HW 01  ComS 311  Fall 2005
Due Date  Friday, September 2
Some problems in this assignment may not be graded!
You, however, should do all the problems because
the choice of problems to be graded will be made after due date.
A.
Read all of Chapter 1 of CLRS
. This Chapter will not be covered in class.
B.
Read all of Chapter 2 of CLRS
.
C.
Read all of Chapter 3 of CLRS
. Section 3.2 will not be covered in class.
D.
Read all of Chapter 4 of CLRS
, except Section 4.4.
E.
Do the following problems
(those with page numbers are from CLRS):
[01] (10 pts.) Suppose you have algorithms with the five running times listed below.
(Assume these are the exact running times.) How much slower do each of these algorithms get
when you
(a)
double the input size, or
(b)
increase the input size by one?
(a)
2
n
(b)
3
n
(c)
2
100
n
(d)
lg
nn
(e) 2
n
[02] (10 pts.) Problem 11, page 13.
[03] (10 pts.) Consider the following basic problem. You’re given an array
A
consisting of
n
integers
A
[1],
A
[2],.
..,
A
[
n
]. You’d like to output a twodimensional
n
by
n
array
B
in which
B
[
i,j
]
(for
ij
<
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
 Fall '08
 PROFESSOR

Click to edit the document details