Here are all the quizzes for CSCE 750, Fall 2011.
CSCE 750, Fall 2011, Quiz 1
Show by grouping the sum into blocks that
∞
n
=2
1
n
(lg
n
)
2
<
∞
.
Do
not
use an integral approximation.
Note: You may assume without proof that
∞
k
=1
1
k
2
<
∞
.
CSCE 750, Fall 2011, Quiz 2
Give an example of an asymptotically positive, realvalued function
f
, defined for all sufficiently
large integers
n
, such that
f
(
n
) =
o
(
n
) but
f
(
n
) =
ω
(
n
1

ε
) for all constant
ε >
0.
You are not required to prove that your answer is correct.
CSCE 750, Fall 2011, Quiz 3
Use the substitution method to show that if
T
(
n
) = 6
T
n
7
+
n,
then
T
=
O
(
n
)
.
Only show the inductive step. Don’t worry about any base case(s).
CSCE 750, Fall 2011, Quiz 4
Using any method you like, but showing your work, find tight asymptotic bounds on any positive
function
T
(
n
) satisfying
T
(
n
) = 2
T
(7
n/
10) +
n
2
.
You may ignore any implicit floors or ceilings.
CSCE 750, Fall 2011, Quiz 5
1
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Let
E
be the experiment where three fair, 6sided dice are rolled. On average, how many times
must you perform
E
until the three values showing are all distinct?
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '11
 Fenner
 Algorithms, Analysis of algorithms, points extra credit

Click to edit the document details