Work Note 7, DM819, fall 2011
Exercises October 6
-
Exercises 6.2, 6.5, 6.7, 6.8, 6.16.
-
Show that it must take at least the order of n log n
to compute a trapezoidal map
(some model assumptions are required to make this formal,
but take that lightly). Hint: reduce from sorting.
-
In Exercise 6.2, we considered bad worst-case situations.
Consider the three complexity issues of search time, construction time,
and storage space. To what extent is it possible to have good performance on
some of these while at the same time having bad performance on others?
Consultations October 11
-
See below and read about the obligatory assignment part 2 on the course
home page for information regarding the consultations.
A link will be sent out via e-mail to your student accounts,
enabling you to book a 15 minute time slot on Tuesday, October 11,
between 12:15 and 14:00, i.e., during the usual meeting time.
To make the booking, you must have a google calendar account.
If you do not have a google calendar account and do not wish to create one,
you can show up in that time interval anyway
and just wait for availability, if necessary.
If you work in pairs, just one of you should book a time slot, but you
should both show up.
Announcements
-
There are no more lectures or exercises this quarter after
the exercises on October 6, but there are possibility for
consultations on October 11.
-
By popular demand, the second and final part of the obligatory assignment
for the course has been posed (see the home page), since many would
like to have the opportunity to work on it during the break between
the two quarters.
Note that before you work on it, you must consult the lecturer.
There is no specific time limit for this consultation, but you ought
to get it done way before the deadline for turning it in.
It is a good idea to just get this done on October 11,
as described above.
Last modified: Fri Sep 30 11:12:35 CEST 2011
Kim Skak Larsen
(kslarsen@imada.sdu.dk)