MIT OpenCourseWare
http://ocw.mit.edu
6.006 Introduction to Algorithms
Spring 2008
For information about citing these materials or our Terms of Use, visit:
http://ocw.mit.edu/terms
.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentIntroduction
to
Algorithms:
6.006
Massachusetts
Institute
of
Technology
March
7,
2008
Professors
Srini
Devadas
and
Erik
Demaine
Handout
5
Problem
Set
3
This
problem
set
is
due
Thursday
March
20
at
11:59PM
.
Solutions
should
be
turned
in
through
the
course
website
in
PDF
form
using
L
A
T
E
X
or
scanned
handwritten
solutions.
A
template
for
writing
up
solutions
in
L
A
T
E
X
is
available
on
the
course
website.
Remember,
your
goal
is
to
communicate.
Full
credit
will
be
given
only
to
the
correct
solution
which
is
described
clearly.
Convoluted
and
obtuse
descriptions
might
receive
low
marks,
even
when
they
are
correct.
Also,
aim
for
concise
solutions,
as
it
will
save
you
time
spent
on
write
ups,
and
also
help
you
conceptualize
the
key
idea
of
the
problem.
Exercises
are
for
extra
practice
and
should
not
be
turned
in.
Exercises:
•
CLRS
6.13
(page
130)
•
CLRS
6.21
(page
132)
•
CLRS
6.31
(page
135)
•
CLRS
6.41
(page
136)
•
CLRS
6.43
(page
136)
•
CLRS
6.54
(page
141)
•
CLRS
8.22
(page
170)
•
CLRS
8.41
(page
177)
1.
(12
points)
Heap
Delete
In
this
problem
you
will
implement
an
additional
operation
in
a
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '08
 ErikDemaine
 Algorithms, Binary heap, Priority queue, detection.py, monotone priority queue

Click to edit the document details