Breaking News
- June 7: Solutions
to today's exam are available.
- May 24: The question hour will take place on Thursday, 1 June
at 9 am in room 2A24. Remember to submit questions to Andrzej
by e-mail.
- April 18: Projects
spring 2006.
- April 11: The last part of the project, see below, has deadline
April 26, not April 24, as it said before in the schedule.
- March 31: A tiny correction of the figure in Project Part 4
(labels changed)
- March 23: The fourth part of
the project has been published.
- March 22: The schedule is updated with reading directions for
the rest of the semester. Short versions of the descriptions of the remaining weeks are avaliable. Exercises will be added later. So no more problems with late reading directions.
- March 20: Reading material for this weeks lecture is now
avaliable.
- March 16: Project Part 3 has
been revised. There were several clarifications in the text. The
two essential changes are marked Errata in the text.
- March 12: If you are still missing motivation for studying
algorithms have a look at February issue of ACM Queue, especially this
article, where a Solaris developer from Sun Microsystems, Bart
Smaalders, advocates early thinking about algorithms for your
application (the interesting fragment comes on page 2).
- March 10: The third part of the
project has been published. Observe that the deadline was
extended by a day.
- March 7: Last moment change in the lecture schedule. We
shall start to talk about dynamic programming on March 8, instead of
amortized analysis, that has been shifted to March 15. Apologies for
late notice.
- March 1: The Grand Programming Contest
IADS 2006F has been launched!!! We wish you all happy hacking.
- February 24: In order to improve the morning quiz results,
we should start the lectures at 8:59 from now on.
- February 22: The second part of the project has been
revised. Variable l in the Order
algorithm has been renamed to p.
- February 21: The second part of
the project (due March 8) has been published.
- February 20: I got a question about how to hand in on
Wednesday. Hand in on paper at the lecture (9.00) or in the pigeon
hole outside the exam office. In special cases electronic hand ins are
allowed. Contact Maria if you want to hand in electronically
(makmo@itu.dk).
- February 18: We will launch the programming contest on
March 1. For this reason there will be no formal exercises on that
day (you are encouraged to work on the contest instead).
- February 14: There was an error in Part 1 of the
project. The definition of a junction should also include endpoints of
roads that do not meet another road. The file is updated (Part 1 of the project). The updated part
is in the second paragraph of Problem 1.
- February 8: Part 1 of the
project is now avaliable. Deadline for handing in is February
22. Please look at it before the exercise session next week, and make
sure that the questions are clear.
- February 8: Links to the animations of heap sort and merge sort
(follow Efficient Sorts), that I could not show today at the
lecture.
- February 1: the math primer takes place on
Monday, February 6, 9am-12pm in room 2A12.
- January 25: The time for the math primer will
be decided at the first lecture. It will be scheduled sometime
between the first and second lecture.
- December 15: The course website has been established.
Time and Place
Lectures: Wednesday 9:00-12:00, Room 2A14.
Tutorials: Wednesday 13:00-16:00, Room 2A14.
Teachers
You are welcome with any problems, concerns, questions
etc. regarding the contents, organization, style etc. of the
course including exercises. You are welcome to contact the
teachers any time you can catch her/him.
We are glad to acknowledge that the folllowing persons were
teachers on this course previously, and contributed to its design: Jens Christian Godskesen, Stephen Alstrup, Theis
Rauhe, Volodya Shavrukov, and Runne Møller Jensen.
Textbook
T.H.Cormen, C.E.Leiserson, R.L.Rivest, C.Stein. Introduction
to Algorithms. 2nd ed. The MIT Press (2001). ISBN
0-262-53196-8. Available in IT-bogladen. (Paperback version.)
Newsgroup
Please post questions and comments to the IADS newsgroup (it-c.courses.IADS)
so that others may answer your questions and/or share your
insights. Feel free to answer each other's questions and comment on
messages. The newsgroup is our discussion forum. Sending and
receiving news messages is very similar to sending and receiving
e-mails. You can use mozilla, the standard mail&news client at
ITU, to read the newsgroups. Ask SysAdm if you need help setting up
your software for reading news. There is also this
information about newsgroups, available from SysAdm.
Assignments
Now, here, you see, it takes all the running you can
do, to keep in the same place.
L. Carroll
Mandatory assignments earn students points towards eligibility for
admission to the exam. Assignments are graded, and students must achieve 70% of the maximum possible point sum to qualify for the exam.
- Part 1 of the project, deadline February 22, 9.00.
- Part 2 of the project, deadline March 8, 9.00.
- Part 3 of the project, deadline March 23(!), 9.00.
- Part 4 of the project, deadline April 5, 9.00.
- Part 5 of the project, deadline April 26, 9.00.
Last updated Nov 29, 2007 14:57